Question 6

A technique for hiding a secret message within a larger document or picture in

such a way that others cannot discern the presence or contents of the hidden
message is __________ .
Steganography

Question 7
The simplest transposition cipher is the _________ technique, in which the
plaintext is written down as a sequence of diagonals and then read off as a
sequence of rows.
rail fence

Question 8
__________ encryption is a form of cryptosystem in which encryption and
decryption are performed using the same key.

Symmetric
Question 9
A __________ cipher processes the input one block of elements at a time,
producing an output block for each input block, whereas a stream cipher processes
the input elements continuously, producing output one element at a time.

Block

Question 10
An encryption scheme is __________ secure if the ciphertext generated by the
scheme does not contain enough information to determine uniquely the
corresponding plaintext, no matter how much ciphertext is available.

unconditionally 
Question 4
The two types of attack on an encryption algorithm are cryptanalysis, based on
properties of the encryption algorithm, and _________ which involves trying all
possible keys.
Brute-force

Question 1
An encryption scheme is said to be __________ if the cost of breaking the cipher
exceeds the value of the encrypted information and the time required to break the
cipher exceeds the useful lifetime of the information.
One-time pad

Question 12
The __________ attack is the easiest to defend against because the opponent has
the least amount of information to work with.

a. chosen ciphertext
b. known plaintext
c. ciphertext-only
d. chosen plaintext

Question 13
An original intelligible message fed into the algorithm as input is known as
_________ , while the coded message produced as output is called the __________
.

a. decryption, encryption
b. ciphertext, plaintext

c. plaintext, ciphertext

d. encryption, decryption
Question 14
A technique referred to as a __________ is a mapping achieved by
performing some sort of permutation on the plaintext letters.

a. Caesar cipher
b. monoalphabetic cipher

c. transposition cipher
d. polyalphabetic cipher

Question 5
__________ techniques map plaintext elements (characters, bits) into ciphertext
elements.

a. Transposition
 b. Substitution
c. Symmetric
d. Traditional

Question 6
The most widely used cipher ever is the __________ .

Data Encryption Standard

Question 10
One of the simplest and best known polyalphabetic ciphers is _________ cipher. In
this scheme, the set of related monoalphabetic substitution rules consists of the 26
Caesar ciphers with shifts of 0 through 25. Each cipher is denoted by a key letter
which is the ciphertext letter that substitutes for the plaintext letter a.
Vigenere

Question 2
With the use of symmetric encryption, the principal security problem is
maintaining the secrecy of the key.

 True
 False

QUESTION 1
1. Rotor machines are sophisticated precomputer hardware devices that use substitution
techniques
 True
 False

10 points   
QUESTION 2
1. The one-time pad has unlimited utility and is useful primarily for high-bandwidth channels requiring
low security

 True
 False

10 points   
QUESTION 3
1. __________ techniques map plaintext elements (characters, bits) into ciphertext
elements
Transposition
Substitution
 Traditional
Symmetric
10 points   
QUESTION 6
1. Block ciphers more closely emulate one-time pads.
 True
 False

QUESTION 4
1. Ciphertext generated using a computationally secure encryption scheme is impossible for an opponent
to decrypt simply because the required information is not there

 True
 False

10 points   
QUESTION 5
1. The __________ was used as the standard field system by the British Army in World
War I and was used by the U.S. Army and other Allied forces during World War II
Caesar cipher
Playfair cipher
Hill cipher
Rail Fence cipher
10 points   
QUESTION 6
1. Techniques used for deciphering a message without any knowledge of the
enciphering details is  ___________
blind deciphering
steganography
cryptanalysis
transposition
10 points   
QUESTION 7
1. On average, half of all possible keys must be tried to achieve success with a
brute-force attack
 True
 False

10 points   
QUESTION 8
1. With the use of symmetric encryption, the principal securit problem is maintaining the
secrecy of the key.
 True
 False

10 points   
QUESTION 9
1. The algorithm will produce a different output depending on the specific secret key being used at the
time. The exact substitutions and transformations performed by the algorithm depend on the key.  
      
 True
 False

10 points   
QUESTION 10
1. __________ attacks exploit the characteristics of the algorithm to attempt to deduce
a specific plaintext or to deduce the key being used
Brute-force
Cryptanalytic
Block cipher
Transposition
10 points   
QUESTION 11
1. Symmetric encryption remains by far the most widely used of the two types of encryption.
 True
 False

10 points   
QUESTION 12
1. Monoalphabetic ciphers are easy to break because they reflect the frequency data of the original
alphabet

 True
 False

10 points   
QUESTION 13
1. The most widely used cipher is the Data Encryption Standard
 True
 False

10 points   
QUESTION 14
1. A scheme known as a one-time pad is unbreakable because it produces random
output that bears no statistical relationship to the plaintext
 True
 False

10 points   
QUESTION 15
1. As with Playfair, the strength of the Hill cipher is that it completely hides single
letter frequencies
 True
 False

10 points   
QUESTION 16
1. A technique referred to as a __________ is a mapping achieved by performing some sort of
permutation on the plaintext letters
transposition cipher
polyalphabetic cipher
Caesar cipher
monoalphabetic cipher
10 points   
QUESTION 17
1. Restoring the plaintext from the ciphertext is __________
deciphering
transposition
steganography
encryption
10 points   
QUESTION 18
1. When using symmetric encryption it is very important to keep the algorithm secret.
 True
 False

10 points   
QUESTION 19
1. An original intelligible message fed into the algorithm as input is known as
_________ , while the coded message produced as output is called the __________
decryption, encryption
plaintext, ciphertext
ciphertext, plaintext
encryption, decryption
10 points   
QUESTION 20
1. The methods of __________ conceal the existence of the message in a graphic image

steganography
decryptology
cryptology
cryptography
10 points   
QUESTION 21
1. Symmetric encryption is a form of cryptosystem in which encryption and
decryption are performed using different keys. It is also known as non-conventional
encryption
 True
 False

10 points   
QUESTION 22
1. The process of converting from plaintext to ciphertext is known as deciphering or
decryption.
  True
 False

10 points   
QUESTION 23
1.   _________ refer to common two-letter combinations in the English language
Streamings
Transpositions
Digrams
Polyalphabetic ciphers
10 points   
QUESTION 24
1. A __________ attack involves trying every possible key until an intelligible
translation of the ciphertext is obtained
brute-force
Caesar attack
ciphertext only
chosen plaintext
10 points   
QUESTION 25
1. The __________ attack is the easiest to defend against because the opponent has the
least amount of information to work with
ciphertext-only
chosen ciphertext
known plaintext
chosen plaintext
10 points   
QUESTION 26
1. Steganography renders the message unintelligible to outsiders by various transformations of the text.

 True
 False

10 points   
QUESTION 27
1. The ___________ takes the ciphertext and the secret key and produces the original
plaintext. It is essentially the encryption algorithm run in reverse
Voronoi algorithm
decryption algorithm
cryptanalysis
diagram algorithm
10 points   
QUESTION 28
1. A way to improve on the simple monoalphabetic technique is to use different monoalphabetic
substitutions as one proceeds through the plaintext message. The general name for this approach is
___________
rail fence cipher
 cryptanalysis
polyalphabetic substitution cipher
polyanalysis cipher
10 points   
QUESTION 29
1. Joseph Mauborgne proposed an improvement to the Vernam cipher that uses a random key that is as
long as the message so that the key does not need to be repeated. The key is used to encrypt and decrypt a
single message and then is discarded. Each new message requires a new key of the same length as the new
message. This scheme is known as a(n) __________

pascaline
one-time pad
polycipher
enigma
10 points   
QUESTION 30
1. If both sender and receiver use the same key, the system is referred to as
public-key encryption
two-key
asymmetric
conventional encryption
 QUESTION 1
1. The heart of a Feistel block cipher is the function F, which relies on the use of S-boxes.

 True
 False

5 points   
QUESTION 2
1. DES exhibits the classic __________  block cipher structure, which consists of a
number of identical rounds of processing
Feistel
SAC
Shannon
Rendell
5 points   
QUESTION 3
1. Fast software encryption/decryption and ease of analysis are two considerations in the design of a
Feistel cipher.
 True
 False

5 points   
QUESTION 4
1. A prime concern with DES has been its vulnerability to brute-force attack because of its relatively short
key length.
 True
 False

5 points   
QUESTION 5
1. An advantage of key-dependent S-boxes is that because they are not fixed, it is impossible to analyze
the S-boxes ahead of time to look for weaknesses.

 True
 False

5 points   
QUESTION 6
1. The criteria used in the design of the __________ focused on the design of the   S-
boxes and on the P function that takes the output of the S-boxes
Avalanche Attack
Data Encryption Standard
Product Cipher
Substitution Key
5 points   
QUESTION 7
1. The vast majority of network based symmetric cryptographic applications make use of stream ciphers.
 True
 False
 5 points   
QUESTION 8
1. A sequence of plaintext elements is replaced by a __________ of that sequence
which means that no elements are added, deleted or replaced in the sequence, but
rather the order in which the elements appear in the sequence is changed
permutation
stream
diffusion
substitution
5 points   
QUESTION 9
1. A __________ cipher is one in which a block of plaintext is treated as a whole and
used to produce a ciphertext block of equal length
block
bit
product
stream
5 points   
QUESTION 10
1. The vast majority of network-based symmetric cryptographic applications  make
use of ________ ciphers
stream
permutation
block
inear
5 points   
QUESTION 11
1. A problem with the ideal block cipher using a small block size is that it is vulnerable to a statistical
analysis of the plaintext.
 True
 False

5 points   
QUESTION 12
1. DES uses a 56-bit block and a 64-bit key
 True
 False

5 points   
QUESTION 13
1. The key schedule algorithm is more popular and has received more attention than S-box design.

 True
 False

5 points   
QUESTION 14
1. The strict avalanche criterion and the bit independence criterion appear to weaken the effectiveness of
the confusion function.

 True
 False

5 points   
QUESTION 15
1. __________ is when each plaintext element or group of elements is uniquely
replaced by a corresponding ciphertext element or group of elements
Substitution
Diffusion
Streaming
Permutation
5 points   
QUESTION 16
1. One of the most intense areas of research in the field of symmetric block ciphers
is __________ design
S-box
F-box
E-box
D-box
5 points   
QUESTION 17
1. All other things being equal, smaller block sizes mean greater security.
 True
 False

5 points   
QUESTION 18
1. Mister and Adams proposed that all linear combinations of S-box columns should
be _________  which are a special class of Boolean functions that are highly nonlinear
according to certain mathematical criteria
horizontal functions
angular functions
bent functions
vertical functions
5 points   
QUESTION 19
1. If the bit-stream generator is a key-controlled algorithm the two users only need to
share the generating key and then each can produce the keystream
 True
 False

5 points   
QUESTION 20
1. Greater complexity in the subkey generation algorithm should lead to greater
difficulty of cryptanalysis
  True
 False

5 points   
QUESTION 21
1. The Feistel cipher structure, based on Shannon's proposal of 1945, dates back over a quarter of a
century and is the structure used by many significant symmetric block ciphers currently in use.
 True
 False

5 points   
QUESTION 22
1. One criterion for an S-box is:  "If two inputs to an S-box differ in exactly one bit, the outputs must also
differ in exactly one bit.
 True
 False

5 points   
QUESTION 23
1. Confusion seeks to make the statistical relationship between the plaintext and
ciphertext as complex as possible in order to thwart attempts to deduce the key.
 True
 False

5 points   
QUESTION 24
1. The Nyberg approach that is more or less a manual approach with only simple
mathematics to support it is __________
human-made
random
math-made
random with testing
5 points   
QUESTION 25
1. Key sizes of __________ or less are now considered to be inadequate
64 bits
32 bits
16 bits
128 bits
5 points   
QUESTION 26
1. Feistel proposed that we can approximate the ideal block cipher by utilizing the
concept of a __________ cipher, which is the execution of two or more simple ciphers in
sequence in such a way that the final result or product is cryptographically stronger
than any of the component ciphers
linear
permutation
differential
product
 5 points   
QUESTION 27
1. The function F provides the element of __________ in a Feistel cipher
clarification
alignment
confusion
stability
5 points   
QUESTION 28
1. A __________ cipher is one that encrypts a digital data stream one bit or one byte at
a time
key
stream
product
block
5 points   
QUESTION 29
1. The greater the number of rounds, the __________ it is to perform cryptanalysis
easier
less difficult
equally difficult
harder
5 points   
QUESTION 30
1. Allowing for the maximum number of possible encryption mappings from the
plaintext block is referred to by Feistel as the __________
ideal substitution cipher
round function
ideal block cipher
diffusion cipher
 QUESTION 1
1. The Advanced Encryption Standard and elliptic curve cryptography rely heavily
on properties of _________
polynomials
order
groups
finite fields
5 points   
QUESTION 2
1. A group is said to be _________ if it satisfies the condition a * b = b * a for all a,
b in G
abelian
infinite
cyclic
commutative
5 points   
QUESTION 3
1. Two integers are __________ if their only common positive integer factor is 1
congruent modulo
polynomials
residual
relatively prime
5 points   
QUESTION 4
1. A _________ is a set of elements in which we can do addition, subtraction, multiplication, and
division without leaving the set
group
field
modulus
ring
5 points   
QUESTION 5
1. A _________ is a group that has a finite number of elements
finite field
finite order
finite group
finite ring
5 points   
QUESTION 7
1. Caesar cipher and the Vigenere cipher are examples of symmetric algorithms.
 True
 False

QUESTION 6
1. Polynomial arithmetic includes the operations of addition, subtraction and multiplication
  True
 False

5 points   
QUESTION 7
1. A field is a set in which we can do addition, subtraction, multiplication and division without
leaving the set
 True
 False

5 points   
QUESTION 8
1. If we attempt to perform polynomial division over a coefficient set that is not a field, we find
that division is not always defined
 True
 False

5 points   
QUESTION 9
1. The Advanced Encryption Standard uses infinite fields
 True
 False

5 points   
QUESTION 10
1. The order of a finite field must be of the form pn where p is a prime and n is a __ .
identity element
positive integer
commutative ring
associative
5 points   
QUESTION 11
1. A cyclic group is always commutative and may be finite or infinite
 True
 False

5 points   
QUESTION 12
1. In ________ algebra we are not limited to ordinary arithmetical operations
finite
commutative
modulus
abstract
5 points   
QUESTION 13
1. The elements of GF(2n) can be defined as the set of all polynomials of degree n – 1 or less with
binary coefficients
 True
 False
 5 points   
QUESTION 14
1. Finite fields play a crucial role in many cryptographic algorithms
 True
 False

5 points   
QUESTION 15
1. A ring is said to be _________ if it satisfies the condition ab = ba for all a, b in R
cyclic
commutative
abelian
infinite
5 points   
QUESTION 16
1. Groups, rings, and fields are the fundamental elements of a branch of mathematics known as
abstract algebra
 True
 False

5 points   
QUESTION 17
1. In the context of abstract algebra we are usually not interested in evaluating a polynomial for a
particular value of x.  To emphasize this point the variable x is sometimes referred to as the __________.
monic
constant
indeterminate
coefficient
5 points   
QUESTION 18
1. With the understanding that remainders are allowed, we can say that polynomial division is
possible if the coefficient set is a __________
ring
field
factor
divisor
5 points   
QUESTION 19
1. Cryptographic algorithms do not rely on properties of finite fields
 True
 False

5 points   
QUESTION 20
1. Examples of _________ are the rational numbers, the real numbers, and the complex numbers
rings
orders
fields
 groups
5 points   
QUESTION 21
1. A ________ group is always abelian and may be finite or infinite
commutative
cyclic
modulus
residue
5 points   
QUESTION 22
1. We can adapt the __________ algorithm to compute the greatest common divisor of two
polynomials
abelian
Euclidean
associative
cyclic
5 points   
QUESTION 23
1. A more important class of finite fields, for cryptography, comprises those with 2n elements depicted as
fields of the form GF(2n).
 True
 False

5 points   
QUESTION 24
1. The Euclidean algorithm cannot be adapted to find the multiplicative inverse of a polynomial
 True
 False

5 points   
QUESTION 25
1. By analogy to integers, an irreducible polynomial is also called a __________
constant polynomial
monic polynomial
polynomial ring
prime polynomial
5 points   
QUESTION 26
1. The ________ of the group is equal to the number of elements in the group
order
integral divisor
generator
modulus
5 points   
QUESTION 27
1. It is easy to find the multiplicative inverse of an element in g(p) for large values of p by constructing a
multiplication table, howeverfor small values of p this approach is not practical
  True
 False

5 points   
QUESTION 28
1. Rings are a subset of a larger class of algebraic structures called  fields
 True
 False

5 points   
QUESTION 29
1. Finite fields are a subset of fields, consisting of those fields with a finite number of elements
 True
 False

5 points   
QUESTION 30
1. Groups are defined by a complex set of properties and are difficult to understand
 True
 False
 QUESTION 1
1. In the AddRoundKey transformation the 128 bits of State are bitwise XORed with the _________
of the round key
64 bits
  128 bits
  256 bits
512 bits

5 points   
QUESTION 2
1. As with any block cipher, AES can be used to construct a message authentication code, and for
this, only decryption is used
 True
 False

5 points   
QUESTION 3
1. At each horizontal point, State is the same for both encryption and decryption
 True
 False

5 points   
QUESTION 4
1. The AES cipher begins and ends with a(n) _________ stage because any other stage,
applied at the beginning or end, is reversible without knowledge of the key and would
add no security
AddRoundKey
ShiftRows
MixColumns
Substitute bytes
5 points   
QUESTION 5
1. The encryption round has the structure :
ShiftRows, MixColumns, SubBytes, InvMixColumns
SubBytes, ShiftRows, MixColumns, AddRoundKey
MixColumns, ShiftRows, SubBytes, AddRoundKey
InvShiftRows, InvSubBytes, AddRoundKey,
InvMixColumns
5 points   
QUESTION 6
1. The ordering of bytes within a matrix is by column
 True
 False

5 points   
QUESTION 7
1. Division requires that each nonzero element have a(n) __________ inverse.
addition
 divisional
multiplicative
subtraction
5 points   
QUESTION 8
1. In the Advanced Encryption Standard the decryption algorithm is identical to the encryption
algorithm
 True
 False

5 points   
QUESTION 9
1. The cipher consists of N rounds, where the number of rounds depends on the  __________
key length
output matrix
State
number of columns
5 points   
QUESTION 10
1. In Advanced Encryption Standard all operations are performed on __________ bytes.
32-bit
8-bit
16-bit
4-bit
5 points   
QUESTION 11
1. The first row of State is not altered; for the second row a 1-byte circular left shift is performed;
for the third row a 2-byte circular left shift is performed; and for the fourth row a 3-byte circular left shift
is performed.  This transformation is called _________________
AddRoundKey
ShiftRows
MixColumns
Substitute bytes
5 points   
QUESTION 12
1. AES uses a Feistel structure
 True
 False

5 points   
QUESTION 13
1. The Rijndael developers designed the expansion key algorithm to be resistant to known
cryptanalytic attacks
 True
 False

5 points   
QUESTION 14
1. The transformations AddRoundKey and InvMixColumn alter the sequence of bytes in State
 True
 False

5 points   
QUESTION 15
1. In the AES structure both encryption and decryption ciphers begin with a(n)
__________ stage, followed by nine rounds that each include all four stages, followed by a
tenth round of three stages.
Substitute bytes
AddRoundKey
MixColumns
ShiftRows
5 points   
QUESTION 16
1. The final round of both encryption and decryption of the AES structure consists of __________
stages
one
two
three
four

5 points   
QUESTION 17
1. DES is a block cipher intended to replace AES for commercial applications
 True
 False

5 points   
QUESTION 18
1. Compared to public-key ciphers such as RSA, the structure of AES  and most symmetric ciphers is
quite complex and cannot beexplained as easily as many other cryptographic algorithms
 True
 False

5 points   
QUESTION 19
1. A __________ is a set in which you can do addition, subtraction, multiplication and division
without leaving the set
standard
field
record
block
5 points   
QUESTION 20
1. The __________ is when a small change in plaintext or key produces a large change in the
ciphertext
avalanche effect
Rcon
 key expansion
auxiliary exchange
5 points   
QUESTION 21
1. InvSubBytes is the inverse of ShiftRows
 True
 False

5 points   
QUESTION 22
1. The Advanced Encryption Standard was published by the  __________ in 2001
AR
K
NIS
T
FIPS
IEE
E

5 points   
QUESTION 23
1. AES can be implemented very efficiently on an 8-bit processor
 True
 False

5 points   
QUESTION 24
1.
The S-box is designed to be resistant to known cryptanalytic attacks
 True
 False

5 points   
QUESTION 25
1. In the general structure of the AES encryption process the input to the encryption and
decryption algorithms is a single _________ block
32-bit
64-bit
128-bit
256-bit

5 points   
QUESTION 26
1. The nonlinearity of the S-box is due to the use of the multiplicative inverse
 True
 False

5 points   
QUESTION 27
1. The inverse add round key transformation is identical to the forward add round key transformation
because the XOR operation is its own inverse
  True
 False

5 points   
QUESTION 28
1. In AES, the arithmetic operations of addition, multiplication and division are performed over
the finite field _________
Zp
a/b = a(b-
1
)
GF(2n-1)
GF(28)
5 points   
QUESTION 29
1. __________ affects the contents of bytes in State but does not alter byte sequence and does not
depend on byte sequence to perform its transformation
InvSubBytes
ShiftRows
SubBytes
InvShiftRows
5 points   
QUESTION 30
1. Virtually all encryption algorithms, both conventional and public- key, involve arithmetic
operations on integers     
 True
 False
QUESTION 5
1. Compared to public-key ciphers such as RSA, the structure of AES  and most symmetric ciphers is
quite complex and cannot be explained as easily as many other cryptographic algorithms
 True
 False
 QUESTION 1
1. In the first instance of multiple encryption plaintext is converted to __________ using the
encryption algorithm
S-AES mode
Triple DES
block cipher
ciphertext
5 points   
QUESTION 2
1. The simplest form of multiple encryption has __________ encryption stages and
__________ keys
four, two
two, three
two, two
three, two
5 points   
QUESTION 3
1. The sender is the only one who needs to know an initialization vector
 True
 False

5 points   
QUESTION 4
1. There are no practical cryptanalytic attacks on 3DES
 True
 False

5 points   
QUESTION 5
1. OFB mode requires an initialization vector that must be unique to each execution of the
encryption operation
 True
 False

5 points   
QUESTION 6
1. Cipher Feedback Mode conforms to the typical construction of a stream cipher
 True
 False

5 points   
QUESTION 7
1. The __________ method is ideal for a short amount of data and is the appropriate
mode to use if you want to transmit a DES or AES key securely
cipher feedback mode
counter mode
output feedback mode
electronic codebook mode
 5 points   
QUESTION 8
1. The output of the encryption function is fed back to the shift register in Output
Feedback mode, whereas in ___________  the ciphertext unit is fed back to the shift register
Cipher Block Chaining mode
Electronic Codebook mode
Cipher Feedback mode
Counter mode
5 points   
QUESTION 9
1. Cipher Feedback (CFB) is used for the secure transmission of single values
 True
 False

5 points   
QUESTION 10
1. The _________ and _________ block cipher modes of operation are used for authentication
CBC, CFB
OFB, CTR
CFB, OFB
ECB, CBC
5 points   
QUESTION 11
1. The XTS-AES mode is based on the concept of a tweakable block cipher.

 True
 False

5 points   
QUESTION 12
1. S-AES is the most widely used multiple encryption scheme
 True
 False

5 points   
QUESTION 13
1. The __________ algorithm will work against any block encryption cipher and does
not depend on any particular property of DES
cipher block chaining
meet-in-the-middle attack
counter mode attack
ciphertext stealing
5 points   
QUESTION 14
1. A mode of operation is a technique for enhancing the effect of a cryptographic algorithm or
adapting the algorithm for an     application
 True
 False
 5 points   
QUESTION 15
1. Given the potential vulnerability of DES to a brute-force attack, an alternative has been found
 True
 False

5 points   
QUESTION 16
1. Once the plaintext is converted to ciphertext using the encryption algorithm the plaintext is
then used as input and the algorithm is applied again
 True
 False

5 points   
QUESTION 17
1. A typical application of Output Feedback mode is stream oriented transmission over noisy
channel, such as satellite communication
 True
 False

5 points   
QUESTION 18
1. “Each block of plaintext is XORed with an encrypted counter.  The counter is
incremented for each subsequent block", is a description of ___________ mode
Cipher Block
Chaining
Counter
Cipher Feedback
Electronic Codebook
5 points   
QUESTION 19
1. Triple DES makes use of __________ stages of the DES algorithm, using a total of
two or three distinct keys
nine
three
six
twelve
5 points   
QUESTION 20
1. __________ mode is suitable for parallel operation.  Because there is no chaining,
multiple blocks can be encrypted or decrypted simultaneously. Unlike CTR mode, this
mode includes a nonce as well as a counter
OFB
S-AES
3DES
XTS-AES
5 points   
QUESTION 21
1. It is possible to convert a block cipher into a stream cipher using cipher feedback, output
feedback and counter modes
 True
 False

5 points   
QUESTION 22
1. Another important mode, XTS-AES, has been standardized by the __________
Security in Storage Working Group
ISO
NIST
ITIL
IEEE
5 points   
QUESTION 23
1. The __________ mode operates on full blocks of plaintext and ciphertext, as
opposed to an s-bit subset
CBC
ECB
OFB
CFB
5 points   
QUESTION 24
1. The XTS-AES standard describes a method of decryption for data stored in sector-based devices
where the threat model includes possible access to stored data by the adversary
 True
 False

5 points   
QUESTION 25
1. _________  mode is similar to Cipher Feedback, except that the input to the
encryption algorithm is the preceding DES output
Cipher Feedback
Counter
Output Feedback
Cipher Block
Chaining
5 points   
QUESTION 26
1. Format-preserving encryption refers to any encryption technique  that takes a plaintext in a
given format and produces a ciphertext in the same format
 True
 False

5 points   
QUESTION 27
1. A finite set of two or more symbols is called a(n) ___________
character
 alphabet
radix
character string
5 points   
QUESTION 28
1. __________ modes of operation have been standardized by NIST for use with symmetric block
ciphers such as DES and AES
Three
Five
Nine
Seven
5 points   
QUESTION 29
1. A number of Internet based applications have adopted two-key 3DES, including PGP and
S/MIME
 True
 False

5 points   
QUESTION 30
1. Both __________ produce output that is independent of both the plaintext and the
ciphertext.  This makes them natural candidates for stream ciphers that encrypt
plaintext by XOR one full block at a time
CBC and ECB
OFB and CTR
ECB and OFB
CTR and CBC
 QUESTION 1
1. An encryption machine used by the Germans during WW2.
Turing
Enigma
Ultra
Purple

5 points   
QUESTION 2
1. The Advanced Encryption Standard (AES) replaced the Data Encryption Standard (DES) in the United
states.
 True
 False

5 points   
QUESTION 3
1. The _______ encryption algorithm, created by IBM, became the American standard for encryption in
the 1970's.
Data Encryption Standard (DES)
Advanced Encryption Standard (AES)
Purple
Pretty Good Privacy (PGP)

5 points   
QUESTION 4
1. The __________ polyalphabetic  cypher uses 26 alphabets.
Alberti
Enigma
Vigenere
Scytale

5 points   
QUESTION 5
1. This ancient application of cryptography, created by the Egyptians more than 4,000 years ago, used
pictures to depict words.
Navajo 
Scytale
Hieroglyphics 
Caesar

5 points   
QUESTION 6
1. This is a transposition cipher used by the Greek Spartans.
Casesar
Vigenere 
Enigma
Scytale
 5 points   
QUESTION 7
1. Using a Caesar Cypher with an offset of three characters (a -> d, b ->e, ...., z -> c), what would be the
correct cypher text for the plain text "attack at dawn"?
nyythd oj kged
attack at dawn
dwwdfn dw gdzq
cuuwfe as ijhz

5 points   
QUESTION 8
1. Which of the following in not part of the CIA triad that is one of the cornerstones of information
security?
Confidentiality
Availability 
Integrity
Authentication

5 points   
QUESTION 9
1. _______ is known as the father of Western cryptography.
Vigenere
Alan Turing
Julius Caesar
Alberti

5 points   
QUESTION 10
1. _________ is the science and practice of safeguarding information through codes.
cryptography
Polyalphabetic
Scientology 
cryptanalysis

5 points   
QUESTION 11
1. Certain encryption algorithms are unbreakable.
 True
 False

5 points   
QUESTION 12
1. Asymmetric encryption uses ___ key(s).
1
2
3
4
 5 points   
QUESTION 13
1. Encryption does not require computers.
 True
 False

5 points   
QUESTION 14
1. Symmetric encryption uses ____ key(s).
1
2
3
4

5 points   
QUESTION 15
1. Asymmetric encryption uses (choose all that apply):
Simple Keys
Public Keys
Auto Keys
Private Keys

5 points   
QUESTION 16
1. With symmetric encryption, you have to share your key.
 True
 False

5 points   
QUESTION 17
1. _________ states that the strength of an encryption algorithm is based on the secrecy of the key, not the
secrecy of the algorithm itself. 
Alberti's Principle
Vigenere's Principle
Kerchoff's Principle
Caesar's Principle

5 points   
QUESTION 18
1. Scytale can be easily deciphered with any diameter rod.
 True
 False

5 points   
QUESTION 19
1. The Caesar Cipher was one of the first implementations of a substitution cipher.
 True
 False

5 points   
 QUESTION 20
1. New technology eliminates the need for encryption. 
 True
 False
QUESTION 10
1. Identify which encryption method each statement relates to.
         -           A.           B.           C.           D.           E.           F.          Visible or A Digital
G.           H.       .
invisible Watermarking
markings B
embedded .
Polyalphabeti
within a c Ciphers
digital file to C One-time
.
indicate Pads
copyright or D Steganograph
other .
handling y
E Transposition
instructions. .
s Ciphers
F. Vigenère
         -           A.           B.           C.           D.           E.           F.          Also known
G.           H.       Ciphers
as Vernam G Codes
ciphers. .
H Running
.
         -           A.           B.           C.           D.           E.           F.         
Key Ciphers
Disguises a
G.           H.      
message by
rearranging
the letters (or
bits) in the
message.

         -           A.           B.           C.           D.           E.           F.          Polyalphabeti

G.           H.      
c cipher that
uses a
keyword
rather than a
number as
the key.
         -           A.           B.           C.           D.           E.           F.          A phrase is
G.           H.      
converted to
a simple
value.

         -           A.           B.           C.           D.           E.           F.          A simple

G.           H.      
substitution
cipher that
uses multiple
 alphabets
rather than
just one.
         -           A.           B.           C.           D.           E.           F.          Takes one
G.           H.      
piece of
information
and hides it
within
another.

         -           A.           B.           C.           D.           E.           F.          Uses the

G.           H.      
numerical
value of
letters in the
plaintext and
is coded and
decoded by
using a copy
of the text in
a book as the
key.
 QUESTION 1
1. The principle requirement of random or pseudorandom number  generation is that the
generated number stream be unpredictable
 True
 False

5 points   
QUESTION 2
1. There are well-defined tests for determining uniform distribution and independence to validate that a
sequence of numbers israndom .
 True
 False

5 points   
QUESTION 3
1. If the PRF does not generate effectively random 128-bit output values it may be possible for an
adversary to narrow thepossibilities and successfully use a brute force attack.
 True
 False

5 points   
QUESTION 4
1. A __________ uses a nondeterministic source to produce randomness.
 CSPRBG
TRNG
PRNG
BBS
5 points   
QUESTION 5
1. The purpose of the Maurer's universal statistical test is to determine whether the number of ones and
zeros in a sequence are approximately the same as would be expected for a truly random sequence.  
      
    
 True
 False

5 points   
QUESTION 6
1. A __________ is used to produce a pseudorandom string of bits of some fixed length.
PRF
PRNG
OFB PRNG
TRNG
5 points   
QUESTION 7
1. A cryptographically secure pseudorandom bit generator is defined as one that passes the least
significant bit test
 True
 False

5 points   
QUESTION 8
1. Three broad categories of cryptographic algorithms are commonly used to create PRNGs:  symmetric
block ciphers, asymmetric ciphers, and hash functions and message authentication codes.
       
 True
 False

5 points   
QUESTION 9
1. The true random number generator may simply involve conversion of an analog source to a
binary output.
 True
 False

5 points   
QUESTION 10
1. The longer the keyword the more difficult the cryptanalysis.
 True
 False

5 points   
QUESTION 11
1. The seed that serves as input to the PRNG must be secure for cryptographic applications
 True
 False

5 points   
QUESTION 12
1. With true random sequences each number is statistically independent of other numbers in the sequence
and therefore unpredictable.
 True
 False

5 points   
QUESTION 13
1. Various methods of modifying a bit stream to reduce or eliminate a bias have
been developed.  These are referred to as ___________ algorithms.
backward
deskewing
forward
keystream
5 points   
QUESTION 14
1. A secret key for symmetric encryption that is generated for use for a short period
of time is called a _________
strategic key
sequence key
session key
stream key
5 points   
QUESTION 15
1. A pseudorandom number generator takes as input a fixed value called the __________ and produces
a sequence of output bits using a deterministic algorithm.
seed
fixed skew
entropy source
keystream
5 points   
QUESTION 16
1. The Blum, Blum, Shub generator is referred to as a ____________ .
TRNG
OFB PRNG
QRN
CSPRBG
5 points   
QUESTION 17
1. In key distribution and reciprocal authentication schemes two communicating
parties cooperate by exchanging messages to distribute keys and/or authenticate each
other.  In many cases ___________ are used for handshaking to prevent replay attacks.
 session keys
nonces
RC4s
entropies
5 points   
QUESTION 18
1. __________ is an open source project for creating truly random numbers using
inexpensive cameras, open source code, and inexpensive hardware.
LavaRnd
Blum, Blum, Shub
Maurer’s statistics
Entropy
5 points   
QUESTION 19
1. The __________ test is the most basic test of randomness and must be included in
any test suite.
frequency
runs
unpredictability
Maurer
5 points   
QUESTION 20
1. The best that can be done to determine if a PRNG generates numbers that have
the characteristic of randomness is on the basis of multiple tests.  These tests should
seek to establish uniformity, scalability, and __________ .
consistency
authentication
frequency
sequencing
5 points   
QUESTION 21
1. A widely used technique for pseudorandom number generation is an algorithm known as the
linear congruential method
 True
 False

5 points   
QUESTION 22
1. The Linux operating system uses _________ entropy sources for generating random
numbers.
four
three
one
two
5 points   
 QUESTION 23
1. A source that is effectively random is referred to as  __________ .
an open source
an entropy source
a keystream
a seed
5 points   
QUESTION 24
1. Examples of a pseudorandom function are decryption keys and nonces
 True
 False

5 points   
QUESTION 25
1. The distribution of bits in a random number sequence should be ___________ ,
therefore the frequency of occurrence of ones and zeros should be approximately equal.
independent
uniform
reversed
streamed
5 points   
QUESTION 26
1. Two approaches that use a block cipher to build a PNRG and have gained
widespread acceptance are:
CTR mode and CFB mode
CTR mode and OFB mode
CBC mode and CFB mode
OFB mode and ECB mode
5 points   
QUESTION 27
1. Random numbers play an important role in the use of encryption for various network security
applications.
 True
 False

5 points   
QUESTION 28
1. A __________ takes as input a source that is effectively random.
PRF
BBS
PRNG
TRNG
5 points   
QUESTION 29
1. The security of Blum, Blum, Shub is based on the difficulty of factoring n
 True
 False
 5 points   
QUESTION 30
1. The stream cipher is similar to the one-time pad with a difference being that a one-time pad uses a
pseudorandom number stream and a stream cipher uses a genuine random number stream.
 True
 False
 QUESTION 1
1. This category of algorithms use a pair of mathematically related keys separately for encryption and
decryption.
asymmetric
symmetric
Advanced Encryption Standard (AES)
One-time pad

10 points   
QUESTION 2
1. Asymmetric algorithms are sometimes used for digital signature apllications.
 True
 False

10 points   
QUESTION 3
1. A weakness of symmetric algorithms is that they are slow and easy to break.
 True
 False

10 points   
QUESTION 4
1. A strength of symmetric algorithms is that they have multiple modes.
 True
 False

10 points   
QUESTION 5
1. A strength of asymmetric algorithms when compared to symmetric algorithms is key management
(sharing keys with others while maintaining secrecy).
 True
 False

10 points   
QUESTION 6
1. Electronic Code Book (ECB) works well with block cyphers.
 True
 False

10 points   
QUESTION 7
1. Cipher Block Chaining (CBC) is similar to Electronic Code Book (ECB) but it uses an
initialization vector (IV) to add security.
 True
 False

10 points   
QUESTION 8
1. Message Integrity Controls (MIC) can be used to detect accidental change, but not intentional change
to a message.
 True
 False
 10 points   
QUESTION 9
1. To protect against an intentional integrity attack, we need to use the following message integrity
control(s): (choose all that apply):
Digital Signature
PARITY
HMAC
CBC-MAC

10 points   
QUESTION 10
1. To protect against an accidental integrity attack, we need to use the following message integrity
control(s): (choose all that apply):
HMAC
PARITY
Checksum
HASH
 QUESTION 1
1. Plaintext is recovered from the ciphertext using the paired key and
_____________ .
a digital signature
a recovery encryption
a decryption algorithm
an encryption algorithm
5 points   
QUESTION 2
1. A __________ is a cryptographic algorithm that uses two related keys, a
public key and a private key.  The two keys have the property that deriving
the private key from the public key is computationally infeasible.
Private Key (Symmetric) Cryptographic Algorithm
Key Exchange Cryptographic Algorithm
Public Key (Asymmetric) Cryptographic Algorithm
RSA Digital Cryptographic Algorithm
5 points   
QUESTION 3
1. Asymmetric encryption transforms plaintext into ciphertext.
 True
 False

5 points   
QUESTION 4
1. The encryption algorithm performs various transformation on the ciphertext
 True
 False

5 points   
QUESTION 5
1. Timing attacks are ciphertext attacks that are only applicable to RAS.
 True
 False

5 points   
QUESTION 6
1. Public-key encryption is also known as __________.
asymmetric encryption
one-way time-exchange encryption
digital-key encryption
optimal-key encryption
5 points   
QUESTION 7
1. We define the ___________ of an algorithm to be f(n) if, for all n and all
inputs of length n the execution of the algorithm takes at most f(n) steps. 
This is a common measure of the efficiency of an algorithm.
time complexity.
one-way function
timing attack
OAEP
5 points   
QUESTION 8
1. Asymmetric encryption can be used for confidentiality but not for authentication.
 True
 False

5 points   
QUESTION 9
1. Two issues to consider with the computation required to use RSA are
encryption/decryption and __________.
time complexity
trap-door one-way functions
key generation
asymmetric encryption padding
5 points   
QUESTION 10
1. Plaintext is transformed into ciphertext using two keys and a decryption algorithm.
 True
 False

5 points   
QUESTION 11
1. A public-key encryption scheme has __________ ingredients.
six
four
eight
two
5 points   
QUESTION 12
1. Asymmetric algorithms rely on one key for encryption and a different but related key for
decryption
 True
 False

5 points   
QUESTION 13
1. The most widely used public-key cryptosystem is __________ .
optimal asymmetric encryption
 asymmetric encryption
RSA
DES
5 points   
QUESTION 14
1. The readable message or data that is fed into the algorithm as input is
the ____________.
ciphertext
exchange
plaintext
encryptio
5 points   
QUESTION 15
1. Public-key algorithms are based on __________ .
permutation
mathematical functions
substitution
symmetry
5 points   
QUESTION 16
1. If the authenticator is encrypted with the sender's private key, it serves as a signature that
verifies origin, content, and sequencing
 True
 False

5 points   
QUESTION 17
1. Asymmetric encryption is also known as ___________ .
optimal-key encryption
digital-key encryption
public-key encryption
private-key encryption
5 points   
QUESTION 18
1. Much of the theory of public-key cryptosystems is based on number theory
 True
 False

5 points   
QUESTION 19
1. The __________ indicates that the subscriber identified in the certificate
has sole control and access to the private key.
OAEP
 Public Key Certificate
Digital Signature
PKI
5 points   
QUESTION 20
1. The key used in symmetric encryption is referred to as a __________
key.
public
secret
private
decryption
5 points   
QUESTION 21
1. A public-key encryption scheme is not vulnerable to a brute-force attack
 True
 False

5 points   
QUESTION 22
1. Public-key encryption is more secure from cryptanalysis than symmetric encryption.
 True
 False

5 points   
QUESTION 23
1. __________ are two related keys, a public key and a private key that are
used to perform complementary operations, such as encryption and
decryption or signature generation and signature verification.
Asymmetric keys
Key exchanges
Symmetric keys
Cipher keys
5 points   
QUESTION 24
1. Before the application of the public-key cryptosystem each participant must generate a pair
of keys
 True
 False

5 points   
QUESTION 25
1. Asymmetric encryption can be used for __________ .
neither confidentiality nor authentication
authentication
 confidentiality
both confidentiality and authentication
5 points   
QUESTION 26
1. __________ depend on the running time of the decryption algorithm.
Mathematical attacks
Timing attacks.
Chosen ciphertext attacks
Brute-force attacks
5 points   
QUESTION 27
1. A major advance in symmetric cryptography occurred with the development of the rotor
encryption/decryption machine.
 True
 False

5 points   
QUESTION 28
1. The defense against the brute-force approach for RSA is to use a large key space
 True
 False

5 points   
QUESTION 29
1. A trap-door one-way function is easy to calculate in one direction and infeasible to calculate in the
other direction unless certain additional information is known
 True
 False

5 points   
QUESTION 30
1. Asymmetric encryption utilizes only a public key for encryption and decryption.
 True
 False
 QUESTION 13
1. Match the following terms with their definitions
         -           A.           B.           C.           D.           E.           F.           G.           H.          Algorith A Where two
I.           J.           K.           L.           M.           N.           O.       m . different
         -           A.           B.           C.           D.           E.           F.           G.           H.          Certificat
messages
I.           J.           K.           L.           M.           N.           O.       would provide
e
the same hash
Authority
or digest value.
(CA)
B Uses two keys
         -           A.           B.           C.           D.           E.           F.           G.           H.          Ciphertex . to encrypt
I.           J.           K.           L.           M.           N.           O.       t data: a public
         -           A.           B.           C.           D.           E.           F.           G.           H.          Collision key known to
I.           J.           K.           L.           M.           N.           O.       s everyone and a
private or
         -           A.           B.           C.           D.           E.           F.           G.           H.          Cryptanal secret key
I.           J.           K.           L.           M.           N.           O.       ysis known only to
         -           A.           B.           C.           D.           E.           F.           G.           H.          Decrypt the recipient of
I.           J.           K.           L.           M.           N.           O.       the message.
         -           A.           B.           C.           D.           E.           F.           G.           H.          Digital Often used to
I.           J.           K.           L.           M.           N.           O.       Signature secure traffic
on the WWW.
         -           A.           B.           C.           D.           E.           F.           G.           H.          Encrypt
C Descrambling
I.           J.           K.           L.           M.           N.           O.      
. an encrypted
         -           A.           B.           C.           D.           E.           F.           G.           H.          Hash
I.           J.           K.           L.           M.           N.           O.      
message and
function
converting it
         -           A.           B.           C.           D.           E.           F.           G.           H.          Key into plaintext.
I.           J.           K.           L.           M.           N.           O.       clustering D An estimate of
         -           A.           B.           C.           D.           E.           F.           G.           H.          Key . the effort/time
I.           J.           K.           L.           M.           N.           O.       space needed to
overcome a
         -           A.           B.           C.           D.           E.           F.           G.           H.          Non- protective
I.           J.           K.           L.           M.           N.           O.       repudiati measure by an
on attacker with
         -           A.           B.           C.           D.           E.           F.           G.           H.          Plaintext specified
I.           J.           K.           L.           M.           N.           O.       expertise and
         -           A.           B.           C.           D.           E.           F.           G.           H.          SSL/TLS resources.
I.           J.           K.           L.           M.           N.           O.       E A trusted
         -           A.           B.           C.           D.           E.           F.           G.           H.          Work . entity or third
I.           J.           K.           L.           M.           N.           O.       factor party
that issues and
signs public
key
certificates,
thereby
attesting to the
validity of the
public keys.
F This is the
. natural or
human-
readable form
of a message.
G Scrambling a
. plaintext
message by
using an
algorithm,
usually in
 conjunction
with a key.
H Proves that the
. message has
not been
altered
(Message
Integrity), and
it proves who
sent the
message (Proof
of Origin and
non-
repudiation).
I. A weakness
that would
exist in
a cryptosystem 
if two different
keys would
generate the
same ciphertex
t from the
same plaintext.

J. A computing
procedure
designed to
perform a task
such as
encryption,
decryption,
compression,
or hashing.
K A security
. service by
which
evidence is
maintained so
that the sender
and recipient
of data cannot
deny having
participated in
the
communicatio
n. Referred to
individually
as non-
repudiation of
origin and non-
repudiation of
receipt.

L Used to ensure
. message
integrity. For
example, when
a message is
 sent over a
communicatio
ns channel,
it may be
altered either
accidentally or
intentionally
while in
transit.

MThe practice of
. defeating the
protective
properties of
cryptography.
Reading
protected
information,
altering
messages or
integrity values,
and violating
authentication
schemes are all
forms of
cryptanalysis.
The practice of
testing
cryptographic
algorithms to
determine their
strength or
resistance to
compromise is
also a form of
cryptanalysis.
N The total
. number of
keys available
to the user of a
cryptosystem.
O This is the
. enciphered,
encrypted, or
scrambled
form of a
message.

Advanced Encryption Standard (AES) replaced the Data Encryption Standard (DES) 
 QUESTION 1
1. For a ___________ defined over GF(2m), the variables and coefficients all
take on values in GF(2m) and in calculations are performed over GF(2m).
cubic equation
prime curve
binary curve
abelian group
5 points   
QUESTION 2
1. For cryptography the variables and coefficients are restricted to
elements in a  __________ field.
primitive.
infinite
public
finite
5 points   
QUESTION 3
1. A considerably larger key size can be used for ECC compared to RSA.
 True
 False

5 points   
QUESTION 4
1. The Diffie-Hellman key exchange is a simple public-key algorithm
 True
 False

5 points   
QUESTION 5
1. (n) __________ is defined by an equation in two variables with
coefficients.
abelian group
binary curve
cubic equation
elliptic curve
5 points   
QUESTION 6
1. __________ are best for software applications.
Binary curves
Prime curves
  Bit operations
Abelian groups
5 points   
 QUESTION 7
1. The __________  cryptosystem is used in some form in a number of
standards including DSS and S/MIME.
Rabin
Rijnedel
Hillman
ElGamal
5 points   
QUESTION 8
1. Elliptic curves are ellipses.
 True
 False

5 points   
QUESTION 9
1. For determining the security of various elliptic curve ciphers it is of some
interest to know the number of points in a finite abelian group defined over an elliptic
curve.
 True
 False

5 points   
QUESTION 10
1. The security of ECC depends on how difficult it is to determine k given kP and P.
 True
 False

5 points   
QUESTION 11
1. The Diffie-Hellman key exchange formula for calculation of a secret
key by User A is:
K = nB x PA
K = nA x PB
K = nP x BA
K = nA x PA
5 points   
QUESTION 12
1. A number of public-key ciphers are based on the use of  an abelian group.
 True
 False

5 points   
QUESTION 13
1. Since a symmetric block cipher produces an apparently random output it can
serve as the basis of a  pseudorandom number generator.
 True
 False
 5 points   
QUESTION 14
1. The Diffie-Hellman algorithm depends on the difficulty of computing discrete
logarithms for its effectiveness.
 True
 False

5 points   
QUESTION 15
1. The __________ key exchange involves multiplying pairs of nonzero
integers modulo a prime number q.  Keys are generated by exponentiation
over the group with exponentiation defined as repeated multiplication.
Diffie-Hellman
Rabin-Miller
Micali-Schnorr
ElGamal
5 points   
QUESTION 16
1. An encryption/decryption system requires that point  Pm be encrypted as a
plaintext.
 True
 False

5 points   
QUESTION 17
1. ECC is fundamentally easier to explain than either RSA or Diffie-Hellman.
 True
 False

5 points   
QUESTION 18
1. __________ can be used to develop a variety of elliptic curve
cryptography schemes.
Elliptic curve arithmetic
Binary curve
Prime curve
Cubic equation
5 points   
QUESTION 19
1. The form of cubic equation appropriate for cryptographic applications for elliptic
curves is  somewhat different for GF(2m) than for Zp.
 True
 False

5 points   
QUESTION 20
1. There is not a computational advantage to using ECC with a shorter
key length than a comparably secure TSA.
 True
 False

5 points   
QUESTION 21
1. Most of the products and standards that use public-key cryptography for encryption
and digital signatures use RSA.

 True
 False

5 points   
QUESTION 22
1. If a secret key is to be used as a _________ for conventional encryption a
single number must be generated.
discrete logarithm
prime curve
session key
primitive root
5 points   
QUESTION 23
1. An encryption/decryption system requires a point G and an elliptic
group _________ as parameters.
Eb(a,q)
Ea(q,b)
En(a,b)
Eq(a,b)
5 points   
QUESTION 24
1. Included in the definition of an elliptic curve is a single element
denoted O and called the point at infinity or the __________ .
prime point
zero point
abelian point
elliptic point
5 points   
QUESTION 25
1. The ____________ protocol enables two users to establish a secret key
using a public-key scheme based on discrete logarithms.
Micali-Schnorr
Elgamal-Fraiser
 Diffie-Hellman
Miller-Rabin
5 points   
QUESTION 26
1. The security of ElGamal is based on the difficulty of computing discrete
logarithms
 True
 False

5 points   
QUESTION 27
1. If three points on an elliptic curve lie on a straight line their sum is
__________ .
0
1
6
3

5 points   
QUESTION 28
1. ____________ makes use of elliptic curves  in which the variables and
coefficients are all restricted to elements of a finite field.
Prime curve
Elliptic curve cryptography(ECC)
abelian group
Micali-Schnorr
5 points   
QUESTION 29
1. For purposes of ECC, elliptic curve arithmetic involves the use of an elliptic curve
equation defined over an  infinite field.
 True
 False

5 points   
QUESTION 30
1. The key exchange protocol is vulnerable to a __________ attack because
it does not authenticate the participants.
one-way function
time complexity
chosen ciphertext
man-in-the-middle
 QUESTION 1
1. __________ is a mechanism or service used to verify the integrity of a message.
Message authentication
Data compression
Data mapping
Message digest
5 points   
QUESTION 2
1. Hash functions can be used for intrusion and virus detections
 True
 False

5 points   
QUESTION 3
1. A ___________ is an algorithm for which it is computationally infeasible to find
either (a) a data object that maps to a pre-specified hash result or (b) two data objects
that map to the same hash result.
cryptographic hash function
strong collision resistance
one-way hash function
compression function
5 points   
QUESTION 4
1. A weak hash function is sufficient to protect against an attack in  which one party generates a
message for another party to sign.
 True
 False

5 points   
QUESTION 5
1. Three new versions of SHA with hash value lengths of 256, 384, and 512 bits are
collectively known as __________.
SHA-3
SHA-1
SHA-2
SHA-0
5 points   
QUESTION 6
1. Message authentication is achieved using a __________.
DES
MDF
SHA
MAC
5 points   
QUESTION 7
1. Big-endian format is the most significant byte of a word in the address byte position-low.
 True
  False

5 points   
QUESTION 8
1. Limited characteristics make it impossible for hash functions to be used to determine whether
or not data has changed
 True
 False

5 points   
QUESTION 9
1. SHA-1 produces a hash value of __________ bits.
224
160
384
256

5 points   
QUESTION 10
1. The cryptographic hash function requirement that guarantees that it is
impossible to find an alternative message with the same hash value as a given message
and prevents forgery when an encrypted hash code is used is the ___________ .
collision resistant
pseudorandomness
preimage resistant
second preimage resistant
5 points   
QUESTION 11
1. The Secure Hash Algorithm design closely models, and is based on, the hash
function __________ .
MD5
FIPS 180
RFC 4634
MD4
5 points   
QUESTION 12
1. The way to measure the resistance of a hash algorithm to cryptanalysis is to compare its strength to the
effort required for a force attack-brute.
 True
 False

5 points   
QUESTION 13
1. The cryptographic hash function is not a versatile cryptographic  algorithm
 True
 False

5 points   
QUESTION 14
1. An ideal hash algorithm will require a cryptanalytic effort __________ the brute-
force effort.
less than or equal to
greater than or equal to
less than
greater than
5 points   
QUESTION 15
1. The most widely used hash function has been the Whirlpool.
 True
 False

5 points   
QUESTION 16
1. Encryption hardware is optimized toward smaller data sizes.
 True
 False

5 points   
QUESTION 17
1. A hash function that satisfies the properties of variable input size, fixed output
size, efficiency, preimage resistant and second preimage resistant is referred to as a
__________.
strong hash function
collision resistant function
weak hash function
preimage resistant function
5 points   
QUESTION 18
1. "Given a hash function H, with n possible outputs and a specific value H(x), if H is
applied to k random inputs, what must be the value of k so that the probability that at
least one input y satisfies H(y) = H(x) is 0.5" is a reference to the __________.
authentication code
collision resistant
big endian
birthday attack
5 points   
QUESTION 19
1. Virtually all cryptographic hash functions involve the iterative use  of a compression function
 True
 False

5 points   
QUESTION 20
1. The principal object of a hash function is __________.
data integrity
compression
collision resistance
 mapping messages
5 points   
QUESTION 21
1. __________ are measures of the number of potential collisions for a given hash
value.
MACs
Primitives
Hash codes
Preimages
5 points   
QUESTION 22
1. A ___________ accepts a variable length block of data as input and produces a fixed
size hash value  h = H(M).
hash resistance
hash value
hash function
hash code
5 points   
QUESTION 23
1. Whirlpool is a popular cryptographic hash function.
 True
 False

5 points   
QUESTION 24
1. A good hash function has the property that “the results of applyin the function to a large set of inputs
will produce outputs that are  evenly distributed and apparently random”
 True
 False

5 points   
QUESTION 25
1. It can be shown that some form of birthday attack will succeed against any hash scheme involving the
use of cipher block chaining without a secret key, provided that either the resulting hash code is small enough or
that a larger hash code can be  decomposed into independent subcodes.
 True
 False

5 points   
QUESTION 26
1. The SHA-512 algorithm has the property that every bit of the hash code is a function of every
bit of the input.
 True
 False

5 points   
QUESTION 27
1. It is possible to use a hash function but no encryption for message authentication
 True
  False

5 points   
QUESTION 28
1. Hash functions are commonly used to create a one-way password file.
 True
 False

5 points   
QUESTION 29
1. The effort required for a collision resistant attack is explained by a mathematical
result referred to as the ___________.
Whirlpool
birthday paradox
hash value
message authentication code
5 points   
QUESTION 30
1. The Secure Hash Algorithm was developed by the ___________.
ITIL
IEEE
ISO
NIST
 QUESTION 1
1. A ciphertext only attack is not difficult because the cryptanalyst has samples of the encrypted text.
 True
 False

5 points   
QUESTION 2
1. Brute force attacks are also known as heuristics.
 True
 False

5 points   
QUESTION 3
1. Frequency attacks is a statistical method that relies on the predictable patterns in a given language.
 True
 False

5 points   
QUESTION 4
1. In a Known Plaintext Attack, the attacker posseses which of the following
plaintext
ciphertext
algorithm
Both plaintext and ciphertext

5 points   
QUESTION 5
1. Moore's Law is a factor in brute force attacks
 True
 False

5 points   
QUESTION 6
1. The number of keys in the key space is a factor in the how hard a cryptographic algorithm is to break
using a brute force algorithm.
 True
 False

5 points   
QUESTION 7
1. Which of the following is not an attack against people?
Birthday attack
Rubber hose attack
Social engineering
Purchase key attack

5 points   
QUESTION 8
1. Which type of attack is typically used against password files or hashed values?
Power analysis attacks
Frequency Analysis
 Timing Attacks
Dictionary attacks

5 points   
QUESTION 9
1. How many symmetric keys would you have to distribute in a system with N users?
[N*(N-1)]/2
N
N*N
N * log(n)

5 points   
QUESTION 10
1. Management has a vested interest in what activities or content may be hidden in encrypted
communications.
 True
 False

5 points   
QUESTION 11
1. This international regulation restricts the export of certain technologies including cryptographic
technologies. 
Wassenaar Arrangement
Free Trade Act
The Waterfall Cryptographic Agreement
The Secured Technologies Act of 2003

5 points   
QUESTION 12
1. Where are certificates stored on the Internet?
Message Digest authority (MDA
Certificate revocation list (CRL)
Registration authority (RA)
Certificate authority (CA)

5 points   
QUESTION 13
1. Which of the following is not a component of a key escrow system?
A user component that handles the generation and use of keys
A component that saves the keys
A recovery component that restores services
Key logger component 

5 points   
QUESTION 14
1. Which of the following is not a part of public key infrastructure (PKI)?
registration authority
digital certificate
certificate authority
 enigma

5 points   
QUESTION 15
1. Key zeroization has to do with the disposing of keys
 True
 False

5 points   
QUESTION 16
1. Multi-Party key Recovery is a solution to break a secret key into three or more pieces and ensure that
each piece is held by a different person.
 True
 False

5 points   
QUESTION 17
1. Rainbow tables have a disadvantage that they require a large amount of memory on a computer.
 True
 False

5 points   
QUESTION 18
1. The criteria that’s used to evaluate trusted hardware is something called 
Common Core
CCI
Common Criteria
Smart Criteria

5 points   
QUESTION 19
1. Out of band key distribution guarantees secure delivery.
 True
 False

5 points   
QUESTION 20
1. One example of a key distribution center (KDC) is the Registration Authority.
 True
 False
 QUESTION 1
1. A ___________ is used to transmit hidden information  within normal network traffic.
multiplexing
covertext
covert channel
stego-key

5 points   
QUESTION 2
1. It is more secure to combine steganography  with cryptography.
 True
 False

5 points   
QUESTION 3
1. Steganography comes from the ancient Greek word that means ____________.
embedded writing
covered writing
plain-site cypher
embedded cypher

5 points   
QUESTION 4
1. The main disadvantage of cryptography is that its obvious that someone has something to hide.
 True
 False

5 points   
QUESTION 5
1. The main disadvantage of steganography is that it's obvious that someone has something to hide.
 True
 False

5 points   
QUESTION 6
1. Which of the following is not used by steganography to prevent piracy?
DRM in iTunes to prevent a song from being played on an unauthorized device
the scrambling of a TV channel signal to prevent unauthorized viewers from watching premium programming
embedded images that appear when a picture is copied
embedded images that appear under ultraviolet light

5 points   
QUESTION 7
1. _______________ is the formal name for a file or other carrier that acts as the means of delivering a
hidden message or payload.
plaintext
covertext
hiddentext
cyphertext
 5 points   
QUESTION 8
1. Cryptography can be used to protect data at rest and data in motion.
 True
 False

5 points   
QUESTION 9
1. Digital signatures are legally binding.
 True
 False

5 points   
QUESTION 10
1. Digital signatures uses cryptography but not hashing.
 True
 False

5 points   
QUESTION 11
1. Digital signatures uses hashing  but not cryptography.
 True
 False

5 points   
QUESTION 12
1. Quantum cryptography differs from techniques in what ways?
Is much faster than current methods
Can create near unbreakable cryptosystems.
All of the above
None of the above

5 points   
QUESTION 13
1. Quantum cryptography is also known as ______________.
Quantum Key Distribution (QKD)
super secure cryptography
Quantum Key Exchange (QKE)
Photon cryptography

5 points   
QUESTION 14
1. Quantum cryptography uses ___________ to create keys.
higher mathematics
one-time pads
certificates 
photons

5 points   
 QUESTION 15
1. Quantum cryptography will allow for much larger keys.
 True
 False

5 points   
QUESTION 16
1. Secure Socket Layer (SSL) relies on PKI.
 True
 False

5 points   
QUESTION 17
1. TLS has replaced SSL as the preferred protocol for protecting Web traffic.
 True
 False

5 points   
QUESTION 18
1. Traditional cryptographic systems, such as AES and PKI, use _________ to create keys. 
certificates
higher mathematics
one-time pads
photons

5 points   
QUESTION 19
1. Truecrypt is software that can encrypt both data and hard drives.
 True
 False

5 points   
QUESTION 20
1. ATMs typically use single factor authentication. 
 True
 False
 QUESTION 1
1. With a __________ attack the attacker is given access to a set of messages and their
signatures
known message
key-only
directed chosen message
generic chosen message
5 points   
QUESTION 2
1. The __________ is formed by taking the hash of the message and encrypting the
message with the creator's private key.
timestamp
message digest
hash code
digital signature
5 points   
QUESTION 3
1. Message authentication may also verify sequencing and timeliness.
 True
 False

5 points   
QUESTION 4
1. The most important development from the work on public-key cryptography is the digital
signature.
 True
 False

5 points   
QUESTION 5
1. A __________ is where the attacker determines the user's private key.
universal forgery
selective forgery
existential forgery
total break
5 points   
QUESTION 6
1. The __________ mode of operation is designed to be parallelizable so that it can
provide high throughput with low cost and low latency.
DAA
CCM
GCM
CTR
5 points   
QUESTION 7
1. A __________ is an algorithm that requires the use of a secret key.
DAA
 SHA
GCM
MAC
5 points   
QUESTION 8
1. The order in which the frame check sequence and encryption functions are performed is not
critical for authentication
 True
 False

5 points   
QUESTION 9
1. With _________ authentication an opponent would have difficulty generating
ciphertext that when decrypted would have valid error control bits.
checksum
CMAC
cipher block chaining
internal error control
5 points   
QUESTION 10
1. Message authentication is a mechanism or service used to verify  the integrity of a message
 True
 False

5 points   
QUESTION 11
1. One means of forming a MAC is to combine a cryptographic hash function in some fashion
with a secret key.
 True
 False

5 points   
QUESTION 12
1. "Release of message contents to any person or process not possessing the
appropriate cryptographic key" is a __________ attack.
content modification
source repudiation
disclosure
sequence modification
5 points   
QUESTION 13
1. __________ is where the attacker forges a signature for a particular message chosen
by the attacker.
Total break
Universal forgery
Existential forgery
Selective forgery
 5 points   
QUESTION 14
1. It is important in a direct digital signature to perform an outer confidentiality function first and
then the signature function.
 True
 False

5 points   
QUESTION 15
1. The ElGamal signature scheme involves the use of the public key for encryption and the
private key for decryption
 True
 False

5 points   
QUESTION 16
1. The digital signature standard is a __________ standard that uses the secure hash
algorithm.
IEEE
NIST
ISO
ITIL
5 points   
QUESTION 17
1. The _________________, which is the latest of the RSA schemes, is the one that RSA
Laboratories recommends as the most secure of the RSA schemes.
RSA-PSS
RSA-PSS
DSA-SDS
EDSDS
5 points   
QUESTION 18
1. The MAC does not provide a digital signature because both sender and receiver share the same
key
 True
 False

5 points   
QUESTION 19
1. The DSS approach makes use of a hash function.
 True
 False

5 points   
QUESTION 20
1. Insertion of messages into the network from a fraudulent source is a __________
attack.
content modification
masquerade
 source repudiation
sequence modification
5 points   
QUESTION 21
1. A brute-force attack on a MAC is easier than a brute-force attack  on a hash function.
 True
 False

5 points   
QUESTION 22
1. Message authentication protects two parties who exchange messages from any third party, however, it
does not protect the two parties against each other.
 True
 False

5 points   
QUESTION 23
1. Confidentiality can be provided by performing message encryption __________ the
MAC algorithm.
before
before or after
after
during
5 points   
QUESTION 24
1. _________ encryption provides authentication among those who share the secret
key.
Message
Asymmetric
Symmetric
Authenticated
5 points   
QUESTION 25
1. As with ElGamal encryption, the global elements of __________ are a prime
number q and a, which is a primitive root of q.
ElGamal digital signature
digital signature standard
digital signature
direct digital signature
5 points   
QUESTION 26
1. The digital signature function does not include the authentication function.
 True
 False

5 points   
QUESTION 27
1. A recipient in possession of the secret key cannot generate an authentication code to verify the
integrity of the message.
 True
 False

5 points   
QUESTION 28
1. A digital signature can guarantee the integrity but not the source of the message.
 True
 False

5 points   
QUESTION 29
1. Similar to the generic attack, except that the list of messages to be signed is
chosen after the attacker knows the user's public key but before any signatures are
seen, is the __________ attack.
directed chosen
key-only
adaptive chosen
known message
5 points   
QUESTION 30
1. It must be computationally infeasible to forge a digital signature, either by constructing a new message
for an existing digitalsignature or by constructing a fraudulent digital signature for a given
message.
 True
 False
QUESTION 58
1. The TLS protocol is preferred to the SSL protocol modern Web applications.
 True
 False
QUESTION 36
1. Stream ciphers typically use the XOR operation.
 True
 False
QUESTION 43
1. Stream ciphers work better than block ciphers for many communication systems such as wireless
communications (wifi).
 True
 False
QUESTION 29
1. It helps to know the amount of data that you are encrypting ahead of time with block ciphers.
 True
 False

QUESTION 28
1. The Rijndael algorithm is better known today as __________.
Data Encryption Standard (DES)
 Advanced Encryption Standard (AES)
Blowfish
Triple Data Encryption Standard (3DES
QUESTION 17
1. The __________ algorithm  became the standard algorithm used by the United States in the 1970's. Its
key length is too short to be effective today.
Rijndael
RC4
Advanced Encryption Standard (AES)
Data Encryption Standard (DES)
QUESTION 14
1. Cryptography can be used to modify data at rest and data in motion.
 True
 False
QUESTION 49
1. Match each law with the corresponding descriptions.
         -           A.           B.           C.           D.           E.    Wassenaar Arrangement  A Provides data privacy for
F.       . safeguarding medical
         -           A.           B.           C.           D.           E.    HIPIAA information
F.      
B International agreement that
         -           A.           B.           C.           D.           E.    PCI DSS . controls the export of
F.      
encryption technologies.
         -           A.           B.           C.           D.           E.    FERPA
F.       C Provides safeguards for
         -           A.           B.           C.           D.           E.    GLBA . credit card transactions
F.       D Provides privacy for
         -           A.           B.           C.           D.           E.    SOX . educational records
F.      
E protects investors
. from fraudulent accounting
activities. 
F. controls the way financial
institutions deal with private
information of individuals.
 Question 1
50 out of 50 points
Identify which encryption method each statement relates to.

Question Correct Match Selected Match

Visible or invisible markings  H.  H.

embedded within a digital file to Digital Digital
indicate copyright or other handling Watermarking Watermarking
instructions.

Also known as Vernam ciphers.  G.   G. 

One-time Pads One-time Pads
Disguises a message by rearranging  C.  C.
the letters (or bits) in the message. Transpositions Transpositions
Ciphers Ciphers
Polyalphabetic cipher that uses a  F.  F.
keyword rather than a number as the Vigenère Vigenère
key. Ciphers Ciphers
A phrase is converted to a simple  B.   B. 
value. Codes Codes

A simple substitution cipher that uses  D.  D.

multiple alphabets rather than just Polyalphabetic Polyalphabetic
one. Ciphers Ciphers
Takes one piece of information and  E.   E. 
hides it within another. Steganography Steganography

Uses the numerical value of letters in  A.  A.

the plaintext and is coded and Running Running
decoded by using a copy of the text Key Ciphers Key Ciphers
in a book as the key.

All Answer Choices

A. 
Running Key Ciphers
B. 
Codes
C. 
Transpositions Ciphers
D. 
 Polyalphabetic Ciphers
E. 
Steganography
F. 
Vigenère Ciphers
G. 
One-time Pads
H. 
Digital Watermarking

 Question 2
5 out of 5 points
Block ciphers more closely emulate one-time pads.

Selected Answer:  False

Answers: True
 False
 Question 3
5 out of 5 points
Caesar cipher and the Vigenere cipher are examples of symmetric algorithms.
Selected Answer:  True
Answers:  True
False
 Question 4
5 out of 5 points
It helps to know the amount of data that you are encrypting ahead of time with block ciphers.

Selected Answer:  True

Answers:  True
False
 Question 5
5 out of 5 points
Kerckhoff believed that the design of an effective encryption algorithm should not have to be kept secret.
Selected Answer:  True
Answers:  True
False
 Question 6
5 out of 5 points
Stream ciphers typically use the XOR operation.

Selected Answer:  True

Answers:  True
False
 Question 7
5 out of 5 points
 Stream ciphers work better than block ciphers for many communication systems such as wireless
communications (wifi).

Selected Answer:  True

Answers:  True
False
 Question 8
5 out of 5 points
Symmetric algorithms are typically known for their ability to maintain _______________.

Selected Answer:  
confidentiality
Answers: integrity
authentication 
availability

 
confidentiality
 Question 9
5 out of 5 points
Symmetric algorithms' effectiveness comes from utilizing multiple keys. 

Selected Answer:  False

Answers: True
 False
 Question 10
5 out of 5 points
The Rijndael algorithm is better known today as __________.
Selected Answer:  
Advanced Encryption Standard (AES)
Answers:  
Advanced Encryption Standard (AES)
Blowfish
Triple Data Encryption Standard (3DES)
Data Encryption Standard (DES)
 Question 11
5 out of 5 points
The __________ algorithm  became the standard algorithm used by the United States in the 1970's. Its key
length is too short to be effective today.

Selected Answer:  
Data Encryption Standard (DES)
Answers:  
Data Encryption Standard (DES)
Advanced Encryption Standard (AES)
 RC4
Rijndael

QUESTION 8
1. Cipher Block Chaining (CBC) uses an initialization vector (IV) to add security.
 True
 False

Question 11
Cryptographic systems are characterized along three independent dimensions: the
type of operations used for transforming plaintext to ciphertext; the way in which
the plaintext is processed; and __________ .
The number of keys used
Question 12
The __________ consist of a set of independently rotating cylinders through
which electrical pulses can flow. Each cylinder has 26 input pins and 26 output
pins with internal wiring that connects each input pin to a unique output pin.
Machine

Question 6
The ________ cipher structure, which dates back over a quarter century and which,
in turn, is based on Shannon’s proposal of 1945, is the structure used by many
significant symmetric block ciphers currently in use.
Feistel

Question 7
Two alternatives to DES are AES and _________ DES.

Triple

Question 8
The __________ criterion is defined as:  "An S-box satisfies GA of order y if, for a
1-bit input change, at least y output bits change."
Guaranteed avalanche

Question 9
In ___________ the statistical structure of the plaintext is dissipated into long-
range statistics of the ciphertext.  This is achieved by having each plaintext digit
affect the value of many ciphertext digits.
Diffusion
Question 10
Feistel’s is a practical application of a proposal by Claude Shannon to develop a
product cipher that alternates confusion and ________ functions.
Diffusion

Question 11
A prime concern with DES has been its vulnerability to brute-force attack because
of its relatively short key length.
 True
 False

Question 12
Confusion seeks to make the statistical relationship between the plaintext and
ciphertext as complex as possible in order to thwart attempts to deduce the key.

 True
 False

Question 13
An advantage of key-dependent S-boxes is that because they are not fixed, it is
impossible to analyze the S-boxes ahead of time to look for weaknesses.
 True
 False

Question 14
If the bit-stream generator is a key-controlled algorithm the two users only need to
share the generating key and then each can produce the keystream. 
 True
 False

Question 15
Greater complexity in the subkey generation algorithm should lead to greater
difficulty of cryptanalysis.

 True
 False

Question 7
The cryptographic strength of a Feistel cipher derives from three aspects of the
design:  the function F, the key schedule algorithm, and __________ .
the number of rounds

Question 8
Two areas of concern regarding the level of security provided by DES are the
nature of the algorithm and the __________.
key size

Question 10
The most widely used encryption scheme is based on the __________ adopted in
1977 by the National Bureau of Standards as Federal Information Processing
Standard 46.
Data Encryption Standard

Question 2
The __________ criterion states that output bits j and k should change
independently when any single input bit i is inverted for all i, j and k.
bit independence

Question 4
The __________ criterion states that any output bit j of an S-box should change
with probability 1/2 when any single input bit i is inverted for all i,j.

strict avalanche
Question 10
The vast majority of network-based symmetric cryptographic applications make
use of ________ ciphers.

a. stream
b. linear
c. permutation
d. block

Question 13
A change in one bit of the plaintext or one bit of the key should produce a change
in many bits of the ciphertext.  This is referred to as the __________ effect.
Avalanche