• Wrong document? Swap it for free
  • Written by students who passed
  • Immediately available after payment
  • Read online or as PDF
Sell
Where do you study
Your language
Document preview thumbnail
Preview 4 out of 31 pages
Exam (elaborations)

Wgu D830 Introduction To Cryptography Bundled Questions And Correct Answers With Rationales New 2026 Update| Instant Download

Document preview thumbnail
Preview 4 out of 31 pages

This study set gives you 60 exam-style questions for WGU D830 Introduction to Cryptography, each with a clear rationale explaining why the answer is right. Topics include symmetric and asymmetric algorithms, hash functions, digital signatures, PKI, Diffie-Hellman, quantum resistance and side-channel attacks. Work through them at your own pace and revisit the ones that slow you down.

Content preview

WGU D830 INTRODUCTION TO CRYPTOGRAPHY
BUNDLED QUESTIONS AND CORRECT ANSWERS
WITH RATIONALES NEW 2026-2027 UPDATE
60 QUESTIONS


TABLE OF CONTENTS

# TOPIC

1 Analyze and compare symmetric and asymmetric cryptographic algorithms, including their modes of
operation and security properties

2 Apply cryptographic primitives such as hash functions and digital signatures to design secure protocols

3 Evaluate key management and distribution schemes, including PKI and Diffie-Hellman, for security and
efficiency

4 Assess contemporary cryptographic challenges, including quantum resistance and side-channel attacks

5 WGU D830 Introduction to Cryptography BUNDLED Questions and Correct Answers with Rationales
New 2026

6 2027 Update

7 Foundations of Cryptography and Information Security

8 Applied Cryptography and Information Security

9 Advanced Cryptography and Information Security

10 Cryptography and Information Security Review


ABSTRACT

This study document brings together 60 carefully worded exam questions drawn from WGU D830
Introduction to Cryptography BUNDLED Questions and Correct Answers with Rationales New
2026-2027 Update, with the strongest emphasis placed on Analyze and compare symmetric and
asymmetric cryptographic algorithms, including their modes of operation and security properties,
Apply cryptographic primitives such as hash functions and digital signatures to design secure
protocols, Evaluate key management and distribution schemes, including PKI and Diffie-Hellman
and for security and efficiency. Every item follows the wording style and level of reasoning you
meet in the real paper, and each one is paired with a clear rationale so the correct choice is never
a guess. Work through the set at your own pace, mark the questions that slow you down, then
come back to them until the reasoning feels automatic. Learners who revise this way walk into the
exam room recognising the pattern behind the questions instead of meeting them for the first time.
Keep going - steady, honest practice is what turns a difficult paper into a comfortable pass.




Page 1

,Q1 ANALYZE AND COMPARE SYMMETRIC AND ASYMMETRIC CRYPTOGRAPHIC
ALGORITHMS, INCLUDING THEIR MODES OF OPERATION AND SECURITY PROPERTIES
In AES-256, the key expansion uses the Rijndael key schedule. If the cipher key is
all zeros, the first round key is identical to the cipher key. What is the primary
purpose of the RotWord and SubWord operations in the key schedule?
A. To introduce non-linearity and diffusion in the key schedule, preventing related-key attacks.
CORRECT

B. To ensure that each round key is a simple permutation of the previous round key.

C. To reduce the key size for each round, optimizing performance.

D. To generate the initial round key from the cipher key.

RATIONALE: RotWord and SubWord introduce non-linearity and diffusion, making the key
schedule resistant to cryptanalysis. They do not simply permute or reduce the key; option B is
incorrect because they add complexity, and D is false because the initial round key is the cipher
key itself.




Q2 ANALYZE AND COMPARE SYMMETRIC AND ASYMMETRIC CRYPTOGRAPHIC
ALGORITHMS, INCLUDING THEIR MODES OF OPERATION AND SECURITY PROPERTIES
When using RSA-OAEP for encryption, which of the following best describes the
role of the hash function and the mask generation function (MGF)?
A. The hash function ensures message integrity, while the MGF is used to derive the symmetric
key.

B. The hash function is used to create a label, and the MGF expands the seed to mask the
message and padding. CORRECT

C. The hash function provides collision resistance, and the MGF is used for key encapsulation.

D. The hash function is optional, and the MGF is used to generate the public exponent.

RATIONALE: In OAEP, a hash function (e.g., SHA-256) creates a label hash, and the MGF (e.g.,
MGF1) expands a random seed to mask the message and padding, achieving semantic security.
Options A, C, and D misrepresent the roles: OAEP does not derive symmetric keys or generate
public exponents, and the hash is not optional.




Page 2

,Q3 ANALYZE AND COMPARE SYMMETRIC AND ASYMMETRIC CRYPTOGRAPHIC
ALGORITHMS, INCLUDING THEIR MODES OF OPERATION AND SECURITY PROPERTIES
In the context of the Diffie-Hellman key exchange, which of the following is the
most significant advantage of using elliptic curve groups over multiplicative
groups of finite fields?
A. Elliptic curve groups allow for shorter key sizes for equivalent security, reducing computational
overhead. CORRECT

B. Elliptic curve groups are immune to quantum computing attacks.

C. Elliptic curve groups require no parameter validation, simplifying implementation.

D. Elliptic curve groups enable the use of the same key for encryption and signing.

RATIONALE: Elliptic curve cryptography provides equivalent security with significantly smaller
key sizes compared to finite field Diffie-Hellman, leading to efficiency gains. Option B is false
because ECC is also vulnerable to quantum attacks; C is false as parameter validation is crucial;
D is incorrect because key usage is separate.




Q4 ANALYZE AND COMPARE SYMMETRIC AND ASYMMETRIC CRYPTOGRAPHIC
ALGORITHMS, INCLUDING THEIR MODES OF OPERATION AND SECURITY PROPERTIES
Which of the following statements accurately describes the security property
provided by a cryptographic hash function that is second preimage resistant?
A. Given a message and its hash, it is computationally infeasible to find a different message with
the same hash. CORRECT

B. Given a hash, it is computationally infeasible to find any message that hashes to it.

C. It is computationally infeasible to find any two distinct messages that hash to the same value.

D. It ensures that the hash function is collision-resistant even if the underlying compression
function is not.

RATIONALE: Second preimage resistance means given a message and its hash, finding a
different message with the same hash is infeasible. Option B describes preimage resistance; C
describes collision resistance; D is false because collision resistance depends on the
compression function.




Page 3

, Q5 ANALYZE AND COMPARE SYMMETRIC AND ASYMMETRIC CRYPTOGRAPHIC
ALGORITHMS, INCLUDING THEIR MODES OF OPERATION AND SECURITY PROPERTIES
In a PKI, a certificate revocation list (CRL) is used to distribute information about
revoked certificates. Which of the following is a primary limitation of CRLs that
Online Certificate Status Protocol (OCSP) aims to address?
A. CRLs are not cryptographically signed, making them vulnerable to tampering.

B. CRLs can become very large and are often distributed less frequently, leading to latency in
revocation status checks. CORRECT

C. CRLs cannot be used with X.509 certificates, requiring a different format.

D. CRLs do not support revocation reasons, limiting their usefulness.

RATIONALE: CRLs can grow large and are typically issued periodically, causing delays in
revocation status propagation; OCSP provides real-time status. Option A is false because CRLs
are signed; C is false as CRLs are used with X.509; D is false because CRLs include revocation
reasons.




Q6 ANALYZE AND COMPARE SYMMETRIC AND ASYMMETRIC CRYPTOGRAPHIC
ALGORITHMS, INCLUDING THEIR MODES OF OPERATION AND SECURITY PROPERTIES
In the context of side-channel attacks, which of the following countermeasures is
most effective against timing attacks on a software implementation of AES?
A. Using a constant-time implementation that avoids data-dependent branches and memory
accesses. CORRECT

B. Increasing the number of rounds in the AES algorithm.

C. Using a larger key size, such as AES-256.

D. Employing a random initialization vector for each encryption.

RATIONALE: Timing attacks exploit variations in execution time; constant-time implementations
eliminate such variations. Increasing rounds or key size does not address timing leaks; IVs are
for mode security, not timing.




Page 4

Document information

Uploaded on
October 8, 2026
Number of pages
31
Written in
2026/2027
Type
Exam (elaborations)
Contains
Questions & answers
$28.99

Wrong document? Swap it for free Within 14 days of purchase and before downloading, you can choose a different document. You can simply spend the amount again.
Written by students who passed
Immediately available after payment
Read online or as PDF

Sold
0
Followers
0
Items
1004
Last sold
-



Why students choose Stuvia

Created by fellow students, verified by reviews

Quality you can trust: written by students who passed their tests and reviewed by others who've used these notes.

Didn't get what you expected? Choose another document

No worries! You can instantly pick a different document that better fits what you're looking for.

Pay as you like, start learning right away

No subscription, no commitments. Pay the way you're used to via credit card and download your PDF document instantly.

Student with book image

“Bought, downloaded, and aced it. It really can be that simple.”

Alisha Student

Working on your references?

Create accurate citations in APA, MLA and Harvard with our free citation generator.

Working on your references?

Frequently asked questions