Page 1 of 47
WGU D334 CRYPTOGRAPHY FINAL EXAM | ACTUAL
EXAM WITH QUESTIONS AND CORRECT ANSWERS |
LATEST UPDATE 2026/2027 | GUARANTEED PASS |
GRADED A+.
In lightweight cryptography, block sizes are relatively smaller than those used
in conventional cryptography and are typically how many bits? Select all that
apply.
90
128
64 80
64 and 80
think its lightweight so 64 to 80
Bifid Cipher
Makes use of a grid and which maps the letters into numeric values. A more
complex version uses a 5x5 square where each matrix uses 25 letters
Playfair Cipher
A 5x5 grid created with a secret phrase (Letters cannot repeat in Grid) nappierrun
Homophonic substitution cipher
cipher that replaces plaintext with multiple different cipher texts
Caesar coding cipher
A Caesar cipher is a simple method of encoding messages. Caesar ciphers use a
substitution method where letters in the alphabet are shifted by some fixed number
of spaces to yield an encoding alphabet. A Caesar cipher with a shift of 1 would
encode an A as a B, an M as an N, and a Z as an A, and so on. Scrambled Alphabet
each letter is connected to a different letter. For ex, A
goes to B
, B goes to T, etc.......
Vignere Cipher what is it and how was it cracked?
, Page 2 of 47
a method of encrypting text by applying a series of Caesar ciphers based on the
letters of a keyword. So it uses multiple alphabet ciphers essentially.
cracked with kasiski examination to determine the key length fractioned morse
code uses 26 character key mapping and coverts plaintext into morse code into
fixed length chunks. Then converted to cipher text letters.
Pig Pen Cipher
Uses a monolithic alphabetic substitution method.
The Pigpen cipher is a type of code where each letter of the alphabet is replaced
with a symbol. These symbols come from a grid or pattern that looks like a tic-
tactoe board or Xs. You write your message using these symbols instead of regular
letters. It's a simple way to turn a plain message into a secret code.
What is the pig pen vulnerability?
Once the mapping is known, it is difficult to keep the message a secret
Rail Fence Cipher
Ciphers that write message letters out diagonally over a number of rows then
read off cipher row by row. Combinations
represent selection of items from a larger set without regard to the order in which
they're chosen. Does not care the order of selections. If we have 3 countries
(america, iceland, Germany) There are 3 combos of 2 countries. permutations an
arrangement of objects in a specific order. AKA a reordering of those objects set
theory
A set is a well defined collection of distinct objects. Called elements or members,
which can be anything. Numbers, colors, even other sets. Sets are typically
denoted with curly braces. ex. A={1,2,3}
OTP
One-Time Pad cipher that is only used once. Near uncrackable cipher that uses
a code book that both parties know.
, Page 3 of 47
Explain each form of Data
ASCII
Computer
UTF-16
Computers read data in binary
ASCII is 8 bit values and supports 256 different characters (2^8)
UTF-16 extends to 16 values. 65,536 or 2^16
Reed solomon
More complex data integrity to detect and correct them. Typically used
in higher level protocols Huffman coding compress data by looking for
patterns in binary or meta data
Lempel-Viz Welsh (LZW)
Adaptive dictionary compression technique known as LZ-77 coding. It is the basis
for many popular compression methods, Suited for a high degree of repetition
how does LZ-78 differ from LZ-77
Builds a dictionary of frequently used characters. ex. The
receiver needs a receipt. recei would be used multiple
times.
little endian vs big endian
Both refer to the order of bytes stored depending on computer architecture type.
Little is the least signifigant byte is stored in the lowest memory address Big is
used in IBM z/Architecture mainframes. The most signifigant byte is stored in the
lowest memory address
Jeff wants to implement a password generation solution within a controlled
environment at his organization that limits the time the password is valid to
10 minutes for visiting contractors. What can Jeff use as a solution?
TOTP
, Page 4 of 47
TSP
Crypt
Bcrypt
TOTP
Time-based one-time password (TOTP) is a computer algorithm that generates a
one-time password (OTP) using the current time as a source of uniqueness. As an
extension of the HMAC-based one-time password algorithm (HOTP), it has been
adopted as Internet Engineering Task Force (IETF) standard RFC 6238.[1]
According to Moore's law, computing capability essentially doubles how
often? 24 months
12 months
5 years
18 months
18 months
Cramer-Shoup system
Cramer–Shoup system is an asymmetric key encryption algorithm, and was the
first efficient scheme proven to be secure against adaptive chosen ciphertext attack
using standard cryptographic assumptions. Its security is based on the
computational intractability (widely assumed, but not proved) of the Decisional
Diffie–Hellman assumption. Developed by Ronald Cramer and Victor Shoup in
1998, it is an extension of the ElGamal cryptosystem. In contrast to ElGamal,
which is extremely malleable, Cramer–Shoup adds other elements to ensure
nonmalleability even against a resourceful attacker. This non-malleability is
achieved through the use of a universal one-way hash function and additional
computations, resulting in a ciphertext which is twice as large as in ElGamal.
______ is a public key encryption method that is an extension of El Gamal but
adds a one-way hashing method which protects against an adaptive chosen
ciphertext attack.
AES-CBC
WGU D334 CRYPTOGRAPHY FINAL EXAM | ACTUAL
EXAM WITH QUESTIONS AND CORRECT ANSWERS |
LATEST UPDATE 2026/2027 | GUARANTEED PASS |
GRADED A+.
In lightweight cryptography, block sizes are relatively smaller than those used
in conventional cryptography and are typically how many bits? Select all that
apply.
90
128
64 80
64 and 80
think its lightweight so 64 to 80
Bifid Cipher
Makes use of a grid and which maps the letters into numeric values. A more
complex version uses a 5x5 square where each matrix uses 25 letters
Playfair Cipher
A 5x5 grid created with a secret phrase (Letters cannot repeat in Grid) nappierrun
Homophonic substitution cipher
cipher that replaces plaintext with multiple different cipher texts
Caesar coding cipher
A Caesar cipher is a simple method of encoding messages. Caesar ciphers use a
substitution method where letters in the alphabet are shifted by some fixed number
of spaces to yield an encoding alphabet. A Caesar cipher with a shift of 1 would
encode an A as a B, an M as an N, and a Z as an A, and so on. Scrambled Alphabet
each letter is connected to a different letter. For ex, A
goes to B
, B goes to T, etc.......
Vignere Cipher what is it and how was it cracked?
, Page 2 of 47
a method of encrypting text by applying a series of Caesar ciphers based on the
letters of a keyword. So it uses multiple alphabet ciphers essentially.
cracked with kasiski examination to determine the key length fractioned morse
code uses 26 character key mapping and coverts plaintext into morse code into
fixed length chunks. Then converted to cipher text letters.
Pig Pen Cipher
Uses a monolithic alphabetic substitution method.
The Pigpen cipher is a type of code where each letter of the alphabet is replaced
with a symbol. These symbols come from a grid or pattern that looks like a tic-
tactoe board or Xs. You write your message using these symbols instead of regular
letters. It's a simple way to turn a plain message into a secret code.
What is the pig pen vulnerability?
Once the mapping is known, it is difficult to keep the message a secret
Rail Fence Cipher
Ciphers that write message letters out diagonally over a number of rows then
read off cipher row by row. Combinations
represent selection of items from a larger set without regard to the order in which
they're chosen. Does not care the order of selections. If we have 3 countries
(america, iceland, Germany) There are 3 combos of 2 countries. permutations an
arrangement of objects in a specific order. AKA a reordering of those objects set
theory
A set is a well defined collection of distinct objects. Called elements or members,
which can be anything. Numbers, colors, even other sets. Sets are typically
denoted with curly braces. ex. A={1,2,3}
OTP
One-Time Pad cipher that is only used once. Near uncrackable cipher that uses
a code book that both parties know.
, Page 3 of 47
Explain each form of Data
ASCII
Computer
UTF-16
Computers read data in binary
ASCII is 8 bit values and supports 256 different characters (2^8)
UTF-16 extends to 16 values. 65,536 or 2^16
Reed solomon
More complex data integrity to detect and correct them. Typically used
in higher level protocols Huffman coding compress data by looking for
patterns in binary or meta data
Lempel-Viz Welsh (LZW)
Adaptive dictionary compression technique known as LZ-77 coding. It is the basis
for many popular compression methods, Suited for a high degree of repetition
how does LZ-78 differ from LZ-77
Builds a dictionary of frequently used characters. ex. The
receiver needs a receipt. recei would be used multiple
times.
little endian vs big endian
Both refer to the order of bytes stored depending on computer architecture type.
Little is the least signifigant byte is stored in the lowest memory address Big is
used in IBM z/Architecture mainframes. The most signifigant byte is stored in the
lowest memory address
Jeff wants to implement a password generation solution within a controlled
environment at his organization that limits the time the password is valid to
10 minutes for visiting contractors. What can Jeff use as a solution?
TOTP
, Page 4 of 47
TSP
Crypt
Bcrypt
TOTP
Time-based one-time password (TOTP) is a computer algorithm that generates a
one-time password (OTP) using the current time as a source of uniqueness. As an
extension of the HMAC-based one-time password algorithm (HOTP), it has been
adopted as Internet Engineering Task Force (IETF) standard RFC 6238.[1]
According to Moore's law, computing capability essentially doubles how
often? 24 months
12 months
5 years
18 months
18 months
Cramer-Shoup system
Cramer–Shoup system is an asymmetric key encryption algorithm, and was the
first efficient scheme proven to be secure against adaptive chosen ciphertext attack
using standard cryptographic assumptions. Its security is based on the
computational intractability (widely assumed, but not proved) of the Decisional
Diffie–Hellman assumption. Developed by Ronald Cramer and Victor Shoup in
1998, it is an extension of the ElGamal cryptosystem. In contrast to ElGamal,
which is extremely malleable, Cramer–Shoup adds other elements to ensure
nonmalleability even against a resourceful attacker. This non-malleability is
achieved through the use of a universal one-way hash function and additional
computations, resulting in a ciphertext which is twice as large as in ElGamal.
______ is a public key encryption method that is an extension of El Gamal but
adds a one-way hashing method which protects against an adaptive chosen
ciphertext attack.
AES-CBC
