Written by students who passed Immediately available after payment Read online or as PDF Wrong document? Swap it for free 4.6 TrustPilot
logo-home
Document preview thumbnail
Preview 4 out of 34 pages
Exam (elaborations)

WGU D334 OBJECTIVE ASSESSMENT CERTIFICATION PAPER 2026 FULL ANSWERS ALREADY PASSED

Document preview thumbnail
Preview 4 out of 34 pages

WGU D334 OBJECTIVE ASSESSMENT CERTIFICATION PAPER 2026 FULL ANSWERS ALREADY PASSED

Content preview

WGU D334 OBJECTIVE ASSESSMENT
CERTIFICATION PAPER 2026 FULL
ANSWERS ALREADY PASSED

⩥ What did WPA replace RC4 with? Answer: TKIP (Temporal Key
Integrity Protocol)


⩥ N denotes natural numbers. These are also sometimes called the
counting numbers. They are 1, 2, 3, etc.


Z denotes the integers. These are whole numbers such as -1, 0, 1, 2, etc.
Basically, this set is the natural numbers combined with zero and the
negative numbers.


Q denotes rational numbers (or the ratios of integers). They are any
number that can be expressed as a ratio of two integers. Examples are
3/2, 17/4, and 1/5.


R denotes real numbers. This includes the rational number as well as
numbers that cannot be expressed as a ratio of two integers, such as 2/3.


i denotes imaginary numbers. These are numbers whose square is a
negative. For example, √-1 = 1i.. Answer: Explain the number
groupings: N, Z, Q, R, i

,⩥ An encryption function for fixed-size blocks of data. The current
generation has a block size of 128 bits (16 bytes).. Answer: block cipher


⩥ To encrypt with a block cipher, we need a ___________.. Answer:
secret key


⩥ Don't ever trust a ____________ or ________________.
(Kerckhoffs's Principle). Answer: secret block cipher; secret algorithm


⩥ A protocol for online shopping with a credit card. One of its features
is that it encrypts the credit card number so that an eavesdropper cannot
copy it.. Answer: SET


⩥ _______________ is the worst enemy of security, and it almost
always comes in the form of features or options.. Answer: Complexity


⩥ ______________ is a measure of how many things interact at any one
point. If the effect of an option is limited to a small part of the program,
then it cannot interact with an option whose effect is limited to another
part of the program.. Answer: Complexity


⩥ The original message, m is called the ______________.. Answer:
plaintext

,⩥ The public-key algorithms are used to establish _________, which in
turn is used to encrypt the actual data. This combines the flexibility of
public-key cryptography with the efficiency of symmetric-key
cryptography.. Answer: a secret key


⩥ Digital signatures are the public-key equivalent of
______________________.. Answer: message authentication codes


⩥ For practical reasons, a PKI is often set up with multiple levels of
CAs. There is a top-level CA, called the ________, which issues
certificates on the keys of lower-level CAs, which in turn certify the user
keys.. Answer: root


⩥ A ____________________ is what most people mean when talking
about breaking an encryption system. This is the situation in which Alice
and Bob are encrypting their data, and all you as the attacker get to see is
the ciphertext. Trying to decrypt a message if you only know the
ciphertext is called a ciphertext-only attack. This is the most difficult
type of attack, because you have the least amount of information..
Answer: ciphertext-only attack


⩥ A ________________ is one in which you know both the plaintext
and the ciphertext. The most obvious goal is to find the decryption key..
Answer: known-plaintext attack

, ⩥ A known-plaintext attack is more powerful than a ciphertext-only
attack.


A True
B False. Answer: A


⩥ A __________________ is any nontrivial method that detects a
difference between the ideal encryption scheme and the actual one. This
covers all the attacks we have discussed so far, as well as any yet-to-be-
discovered attacks.. Answer: distinguishing attack


⩥ A ____________________is an attack that depends on the fact that
duplicate values, also called collisions, appear much faster than you
would expect.. Answer: Birthday attack


⩥ An __________________ attack is one that tries all possible values
for some target object, like the key. If an attack requires 2^235 steps of
work, then this corresponds to an exhaustive search for a 235-bit value..
Answer: exhaustive search


⩥ First introduced by Eli Biham in 1993, a ___________ attack assumes
that the attacker has access to several encryption functions. These
functions all have an unknown key, but their keys have a relationship
that the attacker knows.. Answer: related-key

Document information

Uploaded on
April 10, 2026
Number of pages
34
Written in
2025/2026
Type
Exam (elaborations)
Contains
Questions & answers
$13.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

Seller avatar
Reputation scores are based on the amount of documents a seller has sold for a fee and the reviews they have received for those documents. There are three levels: Bronze, Silver and Gold. The better the reputation, the more your can rely on the quality of the sellers work.
FocusFile7
3.9
(24)
Sold
229
Followers
3
Items
57714
Last sold
1 day ago


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