Page 1 of 25
WGU C839 OBJECTIVE ASSESSMENT 2 (VERSION A &
B) /WGU C839 INTRODUCTION TO CRYPTOGRAPHY
OA ACTUAL EXAM|| ALL QUESTIONS AND 100%
CORRECT ANSWERS||LATEST AND COMPLETE
UPDATE 2027 GUARANTEED A+
What is required for a hash?
Variable length input, fixed length output/Few collisions/Not reversible
Which of the following is used to encrypt email and create digital signatures?
AES/SHA1/RSA/DES
RSA
Bob's password is hashed, and so is John's. Even though they used different
passwords, the hash is the same. What is this called?
A collision
In relationship to hashing, the term _____refers to random bits that are used as one
of the inputs to the hash. Essentially the is intermixed with the message that is to
be hashed
Salt
,Page 2 of 25
This is a 128 bit hash that is specified by RFC 1321. It was designed by Ron Rivest
in 1991 to replace an earlier hash function.
MD5
This hash function uses 512-bit blocks and implements preset constants that
change after each repetition. Each block is hashed into a 256-bit block through four
branches that divides each 512 block into sixteen 32-bit words that are further
encrypted and rearranged
FORK256
Which of the following is an asymmetric algorithm that was first publically
described in 1977?
RSA
What equation describes the encryption process for RSA?
Me % n
Which of the following is an asymmetric algorithm related to the equation y2 = x3
+ Ax + B?
Elliptic Curve
, Page 3 of 25
Which of the following asymmetric algorithms is described by U.S. Patent
5,231,668 and FIPS 186
DSA
Which of the following is the standard for digital certificates?
X.509
Rather than look in a list, one can use a protocol to find revoked certificates. What
protocol is that?
OCSP
What must occur in order for a cipher to be considered 'broken'?
Finding any method that is more efficient than brute force.
____________cryptography uses one key to encrypt a message and a different key
to decrypt it.
Asymmetric
If the round function is a cryptographically secure pseudorandom function, then
___ rounds is sufficient to make the block cipher a pseudorandom permutation. 3
WGU C839 OBJECTIVE ASSESSMENT 2 (VERSION A &
B) /WGU C839 INTRODUCTION TO CRYPTOGRAPHY
OA ACTUAL EXAM|| ALL QUESTIONS AND 100%
CORRECT ANSWERS||LATEST AND COMPLETE
UPDATE 2027 GUARANTEED A+
What is required for a hash?
Variable length input, fixed length output/Few collisions/Not reversible
Which of the following is used to encrypt email and create digital signatures?
AES/SHA1/RSA/DES
RSA
Bob's password is hashed, and so is John's. Even though they used different
passwords, the hash is the same. What is this called?
A collision
In relationship to hashing, the term _____refers to random bits that are used as one
of the inputs to the hash. Essentially the is intermixed with the message that is to
be hashed
Salt
,Page 2 of 25
This is a 128 bit hash that is specified by RFC 1321. It was designed by Ron Rivest
in 1991 to replace an earlier hash function.
MD5
This hash function uses 512-bit blocks and implements preset constants that
change after each repetition. Each block is hashed into a 256-bit block through four
branches that divides each 512 block into sixteen 32-bit words that are further
encrypted and rearranged
FORK256
Which of the following is an asymmetric algorithm that was first publically
described in 1977?
RSA
What equation describes the encryption process for RSA?
Me % n
Which of the following is an asymmetric algorithm related to the equation y2 = x3
+ Ax + B?
Elliptic Curve
, Page 3 of 25
Which of the following asymmetric algorithms is described by U.S. Patent
5,231,668 and FIPS 186
DSA
Which of the following is the standard for digital certificates?
X.509
Rather than look in a list, one can use a protocol to find revoked certificates. What
protocol is that?
OCSP
What must occur in order for a cipher to be considered 'broken'?
Finding any method that is more efficient than brute force.
____________cryptography uses one key to encrypt a message and a different key
to decrypt it.
Asymmetric
If the round function is a cryptographically secure pseudorandom function, then
___ rounds is sufficient to make the block cipher a pseudorandom permutation. 3
