Question 1

The purpose of the __________ algorithm is to enable two users to exchange a secret key securely that can then be used for subsequent encryption of messages.

Accepted Answer

The answer of The purpose of the __________ algorithm is...

Question 2

The DSS makes use of the _________ and presents a new digital signature technique,the Digital Signature Algorithm (DSA).
A)HMAC
B)XOR
C)RSA
D)SHA-1

Accepted Answer

The Digital Signature Standard (DSS) utilizes the Secure Hash Algorithm (SHA-1) as part of its process to generate and verify signatures. SHA-1 is used for creating a digest of the message that is then signed using the Digital Signature Algorithm (DSA), ensuring the integrity and authenticity of the message.

Question 3

_________ are analogous to a burglar guessing a safe combination by observing how long it takes to turn the dial from number to number.
A)Digital standards
B)Mathematical attacks
C)Ciphers
D)Timing attacks

Accepted Answer

Timing attacks involve measuring the time it takes for a cryptographic operation to execute and using that information to deduce the key or other sensitive information. This is an attempt to identify a secret value by analyzing the time taken to execute an algorithmic operation. The analogy given in the question is consistent with a timing attack.

Question 4

One of the first public-key schemes,_______,was developed in 1977 by Ron Rivest,Adi Shamir,and Len Adleman.

Accepted Answer

The answer of One of the first public-key schemes,_______,was developed...

Question 5

The principal attraction of __________ compared to RSA is that it appears to offer equal security for a far smaller bit size,thereby reducing processing overhead.
A)ECC
B)MD5
C)Diffie-Hellman
D)none of the above

Accepted Answer

ECC (Elliptic Curve Cryptography) is the encryption algorithm that offers equal security for a smaller bit size when compared to RSA. This is because ECC is based on elliptic curve theory, which makes it more efficient than RSA, reducing the processing overhead. Therefore, it is the best choice in the given options. MD5 is a hash function and Diffie-Hellman is a key exchange algorithm, so they are not applicable in this context.

Question 6

The evaluation criteria for the new hash function are: security,_______,and algorithm and implementation characteristics.

Accepted Answer

The answer of The evaluation criteria for the new hash...

Question 7

One of the simplest hash functions is the ________ of every block.

Accepted Answer

The answer of One of the simplest hash functions is...

Question 8

The Secure Hash Algorithm (SHA)was developed by the _________ and published as a federal information processing standard (FIPS 180)in 1993.

Accepted Answer

The answer of The Secure Hash Algorithm (SHA)was developed by...

Question 9

The _________ attack exploits the common use of a modular exponentiation algorithm in RSA encryption and decryption,but can be adapted to work with any implementation that does not run in fixed time.
A)mathematical
B)timing
C)chosen ciphertext
D)brute-force

Accepted Answer

The given attack is a timing attack, which exploits the variable time taken by the implementation of modular exponentiation, to extract the private key used in RSA encryption and decryption.

Question 10

______ has been issued as RFC 2014,has been chosen as the mandatory-to-implement MAC for IP Security,and is used in other Internet protocols,such as Transport Layer Security.

Accepted Answer

The answer of ______ has been issued as RFC 2014,has...

Question 11

__________ are alarming for two reasons: they come from a completely unexpected direction and they are a ciphertext-only attack.

Accepted Answer

The answer of __________ are alarming for two reasons: they...

Question 12

NIST has published FIPS PUB 186,which is known as the ___________.

Accepted Answer

The answer of NIST has published FIPS PUB 186,which is...

Question 13

Four possible approaches to attacking the RSA algorithm are: brute force,timing attacks,_________ attacks,and chosen ciphertext attacks.

Accepted Answer

The answer of Four possible approaches to attacking the RSA...

Question 14

___________ was the first published public-key algorithm.
A)NIST
B)Diffie-Hellman
C)RC4
D)RSA

Accepted Answer

Diffie-Hellman was the first published public-key algorithm, introduced in 1976 by Whitfield Diffie and Martin Hellman. This groundbreaking work laid the foundation for the field of public-key cryptography.

Question 15

Although the _________ attack is a serious threat,there are simple countermeasures that can be used such as constant time calcs,random delays or blinding computations.
A)timing
B)chosen ciphertext
C)mathematical
D)none of the above

Accepted Answer

Timing attacks rely on measuring the time taken by a computation, and exploiting any differences in timing to extract information, such as secret keys or passwords. By using techniques such as constant time calcs, random delays, or blinding computations, the timing information becomes much less useful to an attacker, and the attack can be mitigated. Chosen ciphertext attacks and mathematical attacks are not relevant to mitigating timing attacks.

Question 16

The __________ uses an algorithm that is designed to provide only the digital signature function and cannot be used for encryption or key exchange.
A)ECC
B)RSA
C)DSS
D)XOR

Accepted Answer

DSS (Digital Signature Standard) is a US government standard for digital signatures that uses the Digital Signature Algorithm (DSA). It is designed specifically for providing only digital signature functionality and cannot be used for encryption or key exchange. ECC, RSA, and XOR can all be used for encryption and/or key exchange in addition to digital signature functionality.

Question 17

A __________ type of attack exploits properties of the RSA algorithm.
A)timing
B)brute-force
C)chosen ciphertext
D)mathematical

Accepted Answer

Chosen ciphertext attacks can exploit properties of the RSA algorithm, such as the malleability of ciphertexts. In this type of attack, the attacker obtains information by submitting carefully crafted ciphertexts to the system and analyzing the corresponding plaintexts or error messages. This attack can be used to obtain the private key of the system, allowing the attacker to decrypt arbitrary messages.

Question 18

Versions of SHA,with hash value lengths of 256,384,and 512 bits, (SHA-256,SHA-384,and SHA 512)are collectively known as _________.

Accepted Answer

The answer of Versions of SHA,with hash value lengths of...

Question 19

The National Institute of Standards and Technology has published Federal Information Processing Standard FIPS PUB 186,known as the __________.
A)XOR
B)MD5
C)MAC
D)DSS

Accepted Answer

FIPS PUB 186 is the Digital Signature Standard (DSS), which provides a standard for digital signatures used in electronic documents and transactions. XOR is a logical operation used in cryptography, but it is not the same as a standard. MD5 and MAC are also cryptographic tools, but they are not related to the creation of digital signatures.

Question 20

_________ attacks have several approaches,all equivalent in effort to factoring the product of two primes.
A)Mathematical
B)Brute-force
C)Chosen ciphertext
D)Timing

Accepted Answer

Mathematical attacks are the most efficient way to factor the product of two large primes. Brute-force attacks involve trying every possible combination, which is often too time-consuming. Chosen ciphertext and timing attacks both require a significant amount of information about the encryption algorithm and can be difficult to execute successfully.

Quiz 21: Public-Key Cryptography and Message Authentication

The purpose of the __________ algorithm is to enable two users to exchange a secret key securely that can then be used for subsequent encryption of messages.

The DSS makes use of the _________ and presents a new digital signature technique,the Digital Signature Algorithm (DSA) .

_________ are analogous to a burglar guessing a safe combination by observing how long it takes to turn the dial from number to number.

One of the first public-key schemes,_______,was developed in 1977 by Ron Rivest,Adi Shamir,and Len Adleman.

The principal attraction of __________ compared to RSA is that it appears to offer equal security for a far smaller bit size,thereby reducing processing overhead.

The evaluation criteria for the new hash function are: security,_______,and algorithm and implementation characteristics.

One of the simplest hash functions is the ________ of every block.

The Secure Hash Algorithm (SHA)was developed by the _________ and published as a federal information processing standard (FIPS 180)in 1993.

The _________ attack exploits the common use of a modular exponentiation algorithm in RSA encryption and decryption,but can be adapted to work with any implementation that does not run in fixed time.

______ has been issued as RFC 2014,has been chosen as the mandatory-to-implement MAC for IP Security,and is used in other Internet protocols,such as Transport Layer Security.

__________ are alarming for two reasons: they come from a completely unexpected direction and they are a ciphertext-only attack.

NIST has published FIPS PUB 186,which is known as the ___________.

Four possible approaches to attacking the RSA algorithm are: brute force,timing attacks,_________ attacks,and chosen ciphertext attacks.

___________ was the first published public-key algorithm.

Although the _________ attack is a serious threat,there are simple countermeasures that can be used such as constant time calcs,random delays or blinding computations.

The __________ uses an algorithm that is designed to provide only the digital signature function and cannot be used for encryption or key exchange.

A __________ type of attack exploits properties of the RSA algorithm.

Versions of SHA,with hash value lengths of 256,384,and 512 bits, (SHA-256,SHA-384,and SHA 512)are collectively known as _________.

The National Institute of Standards and Technology has published Federal Information Processing Standard FIPS PUB 186,known as the __________.

_________ attacks have several approaches,all equivalent in effort to factoring the product of two primes.