HNO1: Intro to Cryptography WGU D334 OA
Objective Assessment Exam Review Actual Exam
Questions 6-100 and Answers | 100% Pass
Guaranteed | Graded A+ |
INTRODUCTION TO CRYPTOGRAPHY - D334
COMPREHENSIVE FINAL EXAMINATION
130 Questions with Detailed Answer Explanations
Covers All Major Content Areas: Cryptographic Concepts,
Symmetric/Asymmetric Encryption, Hashing, PKI, Blockchain, and More
INSTRUCTIONS
• This examination contains 130 multiple-choice questions designed to
simulate the actual D334 final exam.
• Select the single best answer for each question.
• Answers and detailed explanations are provided immediately following
each question.
• This exam covers: Cryptographic Fundamentals, Symmetric Encryption,
Asymmetric Encryption, Hashing, PKI, Blockchain, Historical Ciphers, and
Cryptographic Attacks.
PART I: CRYPTOGRAPHIC FUNDAMENTALS
,(Questions 1-20)
QUESTION 1
Solve by applying the binary XOR function to the following two binary strings:
0101110101010111
1001100000111010
A) 1100010101101101
B) 1100010101101110
C) 0100010101101101
D) 1100010101100111
ANSWER-: A) 1100010101101101
EXPLANATION: XOR (exclusive OR) returns 1 when the bits are different, 0 when
they are the same:
• 0⊕1=1, 1⊕0=1, 1⊕1=0, 0⊕0=0
• Working through each bit position:
o Position 1: 0⊕1=1
o Position 2: 1⊕0=1
o Position 3: 0⊕0=0
o Position 4: 1⊕1=0
o Position 5: 1⊕1=0
o Position 6: 1⊕0=1
o Position 7: 0⊕0=0
o Position 8: 1⊕0=1
o Position 9: 0⊕0=0
o Position 10: 1⊕1=0
, o Position 11: 0⊕1=1
o Position 12: 1⊕1=0
o Position 13: 0⊕1=1
o Position 14: 1⊕0=1
o Position 15: 1⊕1=0
o Position 16: 1⊕0=1
• Result: 1100010101101101
QUESTION 2
Solve by applying the binary AND function to the following two binary strings:
11011
10000
A) 11011
B) 10000
C) 01011
D) 11111
ANSWER-: B) 10000
EXPLANATION: AND returns 1 only when BOTH bits are 1:
• 1 AND 1 = 1
• 1 AND 0 = 0
• 0 AND 1 = 0
• 0 AND 0 = 0
• 11011 AND 10000 = 10000 (only the first position has both 1's)
,QUESTION 3
Solve by applying the binary OR function to the following two binary strings:
11011
10000
A) 11011
B) 10000
C) 01011
D) 01000
ANSWER-: A) 11011
EXPLANATION: OR returns 1 if AT LEAST ONE bit is 1:
• 1 OR 1 = 1
• 1 OR 0 = 1
• 0 OR 1 = 1
• 0 OR 0 = 0
• 11011 OR 10000 = 11011
QUESTION 4
Calculate: 15 mod 7 = ?
A) 2
B) 1
C) 7
D) 8
ANSWER-: B) 1
EXPLANATION: Modulo (mod) gives the remainder after division:
• 15 ÷ 7 = 2 with remainder 1
, • Therefore, 15 mod 7 = 1
QUESTION 5
Calculate: 12 mod 7 = ?
A) 5
B) 4
C) 6
D) 7
ANSWER-: A) 5
EXPLANATION:
• 12 ÷ 7 = 1 with remainder 5
• Therefore, 12 mod 7 = 5
QUESTION 6
Encryption, in simplest terms, is:
A) Converting ciphertext into plaintext
B) Changing plaintext into ciphertext
C) Hashing a message for integrity
D) Signing a message with a private key
ANSWER-: B) Changing plaintext into ciphertext
EXPLANATION:
• Encryption: The process of converting readable plaintext into unreadable
ciphertext
• Decryption: The reverse process of converting ciphertext back to plaintext
• The goal is to protect confidentiality
,QUESTION 7
Decryption is defined as:
A) The process of converting plaintext into ciphertext
B) The process of converting ciphertext into plaintext
C) The process of hashing a message
D) The process of generating a key pair
ANSWER-: B) The process of converting ciphertext into plaintext
EXPLANATION:
• Decryption: Reverses encryption to recover the original message
• Requires the appropriate key (same key for symmetric, opposite key for
asymmetric)
QUESTION 8
_____ measures the level of unpredictability; in encryption it relates to the
degree of uncertainty of the encryption process.
A) Work factor
B) Entropy
C) Collision
D) Frequency
ANSWER-: B) Entropy
EXPLANATION:
• Entropy: Measure of randomness or unpredictability
• High entropy = more random = stronger encryption
• Used in generating keys, IVs, and random numbers
, • Work factor: Time/effort required to break a system
QUESTION 9
This represents the time and effort required to break a cryptography system:
A) Entropy
B) Collision
C) Work Factor
D) Frequency Analysis
ANSWER-: C) Work Factor
EXPLANATION:
• Work factor: Computational effort needed to break a cryptographic system
• Determines practical security (if work factor exceeds attacker's resources,
system is secure)
• Used in key size selection and algorithm choice
QUESTION 10
_____ encoding involves 8-bit values and supports up to 256 characters.
A) UTF-16
B) ASCII
C) UTF-32
D) EBCDIC
ANSWER-: B) ASCII
EXPLANATION:
• ASCII (American Standard Code for Information Interchange): 7 or 8-bit
encoding
Objective Assessment Exam Review Actual Exam
Questions 6-100 and Answers | 100% Pass
Guaranteed | Graded A+ |
INTRODUCTION TO CRYPTOGRAPHY - D334
COMPREHENSIVE FINAL EXAMINATION
130 Questions with Detailed Answer Explanations
Covers All Major Content Areas: Cryptographic Concepts,
Symmetric/Asymmetric Encryption, Hashing, PKI, Blockchain, and More
INSTRUCTIONS
• This examination contains 130 multiple-choice questions designed to
simulate the actual D334 final exam.
• Select the single best answer for each question.
• Answers and detailed explanations are provided immediately following
each question.
• This exam covers: Cryptographic Fundamentals, Symmetric Encryption,
Asymmetric Encryption, Hashing, PKI, Blockchain, Historical Ciphers, and
Cryptographic Attacks.
PART I: CRYPTOGRAPHIC FUNDAMENTALS
,(Questions 1-20)
QUESTION 1
Solve by applying the binary XOR function to the following two binary strings:
0101110101010111
1001100000111010
A) 1100010101101101
B) 1100010101101110
C) 0100010101101101
D) 1100010101100111
ANSWER-: A) 1100010101101101
EXPLANATION: XOR (exclusive OR) returns 1 when the bits are different, 0 when
they are the same:
• 0⊕1=1, 1⊕0=1, 1⊕1=0, 0⊕0=0
• Working through each bit position:
o Position 1: 0⊕1=1
o Position 2: 1⊕0=1
o Position 3: 0⊕0=0
o Position 4: 1⊕1=0
o Position 5: 1⊕1=0
o Position 6: 1⊕0=1
o Position 7: 0⊕0=0
o Position 8: 1⊕0=1
o Position 9: 0⊕0=0
o Position 10: 1⊕1=0
, o Position 11: 0⊕1=1
o Position 12: 1⊕1=0
o Position 13: 0⊕1=1
o Position 14: 1⊕0=1
o Position 15: 1⊕1=0
o Position 16: 1⊕0=1
• Result: 1100010101101101
QUESTION 2
Solve by applying the binary AND function to the following two binary strings:
11011
10000
A) 11011
B) 10000
C) 01011
D) 11111
ANSWER-: B) 10000
EXPLANATION: AND returns 1 only when BOTH bits are 1:
• 1 AND 1 = 1
• 1 AND 0 = 0
• 0 AND 1 = 0
• 0 AND 0 = 0
• 11011 AND 10000 = 10000 (only the first position has both 1's)
,QUESTION 3
Solve by applying the binary OR function to the following two binary strings:
11011
10000
A) 11011
B) 10000
C) 01011
D) 01000
ANSWER-: A) 11011
EXPLANATION: OR returns 1 if AT LEAST ONE bit is 1:
• 1 OR 1 = 1
• 1 OR 0 = 1
• 0 OR 1 = 1
• 0 OR 0 = 0
• 11011 OR 10000 = 11011
QUESTION 4
Calculate: 15 mod 7 = ?
A) 2
B) 1
C) 7
D) 8
ANSWER-: B) 1
EXPLANATION: Modulo (mod) gives the remainder after division:
• 15 ÷ 7 = 2 with remainder 1
, • Therefore, 15 mod 7 = 1
QUESTION 5
Calculate: 12 mod 7 = ?
A) 5
B) 4
C) 6
D) 7
ANSWER-: A) 5
EXPLANATION:
• 12 ÷ 7 = 1 with remainder 5
• Therefore, 12 mod 7 = 5
QUESTION 6
Encryption, in simplest terms, is:
A) Converting ciphertext into plaintext
B) Changing plaintext into ciphertext
C) Hashing a message for integrity
D) Signing a message with a private key
ANSWER-: B) Changing plaintext into ciphertext
EXPLANATION:
• Encryption: The process of converting readable plaintext into unreadable
ciphertext
• Decryption: The reverse process of converting ciphertext back to plaintext
• The goal is to protect confidentiality
,QUESTION 7
Decryption is defined as:
A) The process of converting plaintext into ciphertext
B) The process of converting ciphertext into plaintext
C) The process of hashing a message
D) The process of generating a key pair
ANSWER-: B) The process of converting ciphertext into plaintext
EXPLANATION:
• Decryption: Reverses encryption to recover the original message
• Requires the appropriate key (same key for symmetric, opposite key for
asymmetric)
QUESTION 8
_____ measures the level of unpredictability; in encryption it relates to the
degree of uncertainty of the encryption process.
A) Work factor
B) Entropy
C) Collision
D) Frequency
ANSWER-: B) Entropy
EXPLANATION:
• Entropy: Measure of randomness or unpredictability
• High entropy = more random = stronger encryption
• Used in generating keys, IVs, and random numbers
, • Work factor: Time/effort required to break a system
QUESTION 9
This represents the time and effort required to break a cryptography system:
A) Entropy
B) Collision
C) Work Factor
D) Frequency Analysis
ANSWER-: C) Work Factor
EXPLANATION:
• Work factor: Computational effort needed to break a cryptographic system
• Determines practical security (if work factor exceeds attacker's resources,
system is secure)
• Used in key size selection and algorithm choice
QUESTION 10
_____ encoding involves 8-bit values and supports up to 256 characters.
A) UTF-16
B) ASCII
C) UTF-32
D) EBCDIC
ANSWER-: B) ASCII
EXPLANATION:
• ASCII (American Standard Code for Information Interchange): 7 or 8-bit
encoding
