1.

Fall 2021 - Cryptography (ISOL-535-A04) - First Bi-Term

Course Fall 2021 - Cryptography (ISOL-535-A04) - First
Bi-Term
Test Midterm Exam
Status Completed
Attempt Score 131 out of 180 points
Time Elapsed 1 hour, 41 minutes out of 2 hours and 30
minutes
Results Submitted Answers
Displayed
 Question 1
Criteria for Evaluating Block system are :
Selected a.
Answer: Key Size
Block Size
Estimated Security Level
Complexity of Cryptographic Mapping
Data Expansion
Error Propagation
 Question 2
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 __________ .

Selected indeterminate
Answer:
 Question 3
The four separate functions of the Advanced Encryption Standard are: permutation, arithmetic
operations over a finite field, XOR with a key, and __________ .
Selected Byte
Answer: Substitution
 Question 4
Affine Algorithm with k1=1 and k2= 1,2,...n will be exactly like
Selected d.
Answer: Block Cipher
 Question 5
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) __________ .
Selected c.
Answer: one-time pad
  Question 6

The inverse add round key transformation is identical to the forward add round key
transformation because the XOR operation is its own inverse.
Selected Tru
Answer: e
 Question 7
The _________ and _________ block cipher modes of operation are used for authentication.
Selected CBC, CFB
Answer:
 Question 8
The input to the encryption algorithm is the XOR of the next 64 bits of plaintext and the preceding 64 bits
of ciphertext is a description of __________ mode.
Selected CB
Answer: C
 Question 9
P t = "to be or not to be" and the Algorithm is Message revierse , Then P t =
Selected c.
Answer: EBOTTONROEBOT
 Question 10

One of the basic techniques of number theory is the __________ algorithm which is a simple
procedure for determining the greatest common divisor of two polynomials.
Selected Euclide
Answer: an
 Question 11

The S-box for AES is based on applying the following Affine transformation (over
GF(2) ):
Selected b.
Answer:

 Question 12
Diffusion is :
Selected d.
Answer: “The statistical structure of the Plaintext is spread (dissipated) into long-range statistics
of the Ciphertext.”
 Question 13
Plsintext ="TOBEORNOTTOBE", use 'Zig-Zag' and key =123, then Ciphertext is
Selected a.
Answer: "TBOOTOEOEROTB"
 Question 14

Two integers are __________ if their only common positive integer factor is 1.
Selected relatively prime
Answer:
 Question 15
A __________ is a symmetric encryption algorithm in which ciphertext output is produced bit-by-bit
or byte-by-byte from a stream of plaintext input.
Selected Stream
Answer: Cipher
 Question 16
Solve x + 12=3 ( mod5 ).
Selected X = -9
Answer:
 Question 17
x 15 (mod 8) and x 11 (mod 3) , Solution x 23 (mod 24)

x 23 (mod 24) and x 12 (mod 13), Solution x 311 (mod 312)

x 311 (mod 312) and x 3 (mod 7) solution x 311 (mod 2184)

Selected X = 15, X =2, X=23

Answer: X =23, X=12, X=311
X=311, X=3, X=311
 Question 18
Various methods of modifying a bit stream to reduce or eliminate a bias have been developed.
These are referred to as ___________ algorithms.
Selected e.
Answer: deskewing
 Question 19
The Blum, Blum, Shub generator is referred to as a ____________
Selected e.
Answer: CSPRBG
 Question 20
The Decrypt of the following Ciphertext “MTXDVZMDNBCDFBTICWBLBZO “using Affine algorithm
with keys k1= 7, k2=25 is “now is a nice time of the spring”
Selected Fals
Answer: e
 Question 21

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.

Selected AddRoundKey
Answer:
  Question 22

It is important to note that the Repetition Count Test described in Section 8.6 is not a
very powerful health test. It is able to detect only catastrophic failures of an entropy
source. For example, a noise source evaluated at 8 bits of min-entropy per sample
has a cutoff value of 5 repetitions to ensure a false-positive rate of approximately
once per four billion samples generated. If that noise source somehow failed to the
point that it was providing only 6 bits of min-entropy per sample, how many samples
would be expected to be needed before the Repetition Count Test would notice the
problem?
Selected 4
Answer:
 Question 23
Operating systems typically provide a built-in mechanism for generating random numbers. For
example, __________ uses mouse and keyboard activity, disk I/O operations, and specific
interrupts.
Selected linu
Answer: x
 Question 24

Operating systems typically provide a built-in mechanism for generating random

numbers. For example, __________ uses mouse and keyboard activity, disk I/O operations,
and specific interrupts
Selected linu
Answer: x
 Question 25

__________________________: The security goal that generates the requirement for

actions of an entity to be traced uniquely to that entity. This supports nonrepudiation,
deterrence, fault isolation, intrusion detection and prevention, and afteraction recovery
and legal action. Because truly secure systems are not yet an achievable goal, we
must be able to trace a security breach to a responsible party. Systems must keep
records of their activities to permit later forensic analysis to trace security breaches or
to aid in transaction disputes
Selected b.
Answer: None of the above
 Question 26
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.
Selected Tru
Answer: e
 Question 27

A prime concern with DES has been its vulnerability to brute-force attack because of its relatively
short key length.
Selected Tru
Answer: e
  Question 28
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.
Selected Fals
Answer: e
 Question 29

The plaintext of a sector or data unit is organized in to blocks of 128 bits. For encryption
and decryption, each block is treated independently. The only exception occurs when the
last block has less than 128 bits. In that case the last two blocks are
encrypted/decrypted using a ___________ technique instead of padding.
Selected Count
Answer: er
 Question 30
A more important class of finite fields, for cryptography, comprises those with 2n elements depicted as
fields of the form GF(2n).

Selected Tru
Answer: e
 Question 31
Solve the following system
x 19 (mod 5)

x 17 (mod 6)

x 23 (mod 9)

x 7 (mod 7)

x 11 (mod 31)

x 23 (mod 1)

x 12 (mod 19)

Selected X=4
Answer: X=5
X=5
X=0
X=11
X=0
X=12
 Question 32

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.
Selected bent functions
Answer:
  Question 33
A __________ is used to produce a pseudorandom string of bits of some fixed length.
Selected e.
Answer: PRF
 Question 34
When the PT-109 American patrol boat, under the command of Lieutenant John F.
Kennedy, was sunk by a Japanese destroyer, a message was received at an Australian
wireless station in Playfair code:

KXJEY UREBE ZWEHE WRYTU HEYFS

KREHE GOYFI WTTTU OLKSY CAJPO
BOTEI ZONTX BYBNT GONEY CUZWR
GDSON SXBOU YWRHE BAAHY USEDQ

The key used was royal new zealand navy. Decrypt the message. Translate TT into tt.
Selected c.
Answers: PT BOAT ONE OWE NINE LOST IN ACTION IN BLACKETT STRAIT TWO MILES SW
MERESU COVE X CREW OF TWELVE X REQUEST ANY INFORMATION
 Question 35
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 shifter register.

Selected Cipher Feedback mode

Answer:
 Question 36

An example of a finite field is the set Zp consisting of all the integers {0, 1, . . . , p - 1},
where p is a __________ and in which arithmetic is carried out modulo p.
Selected Prime
Answer: Number
 Question 37

PCBC mode of operation Encryption is

Selected d.
Answer:

 Question 38

The distribution of bits in a random number sequence should be ___________ , therefore the
frequency of occurrence of ones and zeros should be approximately equal.
Selected uniform
Answer:
 Question 39

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.
Selected permutation
Answer:
 Question 40
The encryption round has the structure:

Selected SubBytes, ShiftRows, MixColumns, AddRoundKey

Answer:
 Question 41
A modulus of 0 does not fit the definition but is defined by convention as follows:
a mod 0 = a. With this definition in mind, what does the following expression mean:
a K b (mod 0)?
Selected aKb
Answer:
 Question 42
Your key is “01010101010101010101010101010101010101010101010101010101”, your plain text is
“gohomeno” find the first L[0]and R[0]
Selected L[0] = 010
Answer: R[0] = 101
 Question 43

If b|a we say that b is a divisor of a.

Selected Tru
Answer: e
 Question 44

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.
Selected Rail-
Answer: Fence
 Question 45
Affine Algorithm with Ciphertext of “UIFBGGJOFDJQIFSBMHPSJUIN ” and keys of 1 and 1 will gives
the Plaintext of
Selected d.
Answer: The Affine cipher
algorithm
 Question 46
is an open source project for creating truly random numbers using inexpensive cameras, open
source code, and inexpensive hardware.
Selected d.
Answer: LavaRnd
 Question 47
The _________ class [x + 1] consists of all polynomials a(x) that satisfy the
quality a(x) mod m(x) = x + 1.
Selected residu
Answer: e
 Question 48

In a stream cipher structure a key is input to a pseudorandom bit generator that

produces a stream of 8-bit numbers that are apparently random. The output of the
generator, called a ___________ , is combined one byte at a time with the plaintext stream
using the bitwise exclusive-OR operation.
Selected Keystrea
Answer: m
 Question 49

Two integers a and b are said to be congruent modulo n, if (a mod n) = (b mod n).
Selected Tru
Answer: e
 Question 50
Two specific authentication services defined in X.800 are peer entity authentication and _________
authentication.
Selected Data
Answer: Origin
 Question 51
The Ciphertext is “ UJQHLGYJSHZQ AK LZW KUAWFUW”. The algorithm is Direct Standard
Algorithm and key is 943220 the Plaintext is text is
Selected d.
Answer: cryptography is the science
 Question 52

Examples of a pseudorandom function are decryption keys and nonces.

Selected Fals
Answer: e
 Question 53

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 .
Selected OFB and CTR
Answer:
 Question 54

An integer p >1 is a _________ number if and only if its only divisors are + 1 and + p
Selected prime
Answer:
 Question 55
The AES key expansion algorithm takes as input a four-word (16-byte) key and produces a linear array
of __________ words (176 bytes).
Selected 4
Answer: 4
 Question 56

All the techniques for providing security have two components: a security-related
transformation on the information to be sent and some secret information shared by
the two principals
Selected Tru
Answer: e
 Question 57
The true random number generator may simply involve conversion of an analog source to a binary
output.

Selected Tru
Answer: e
 Question 58

The __________ standard describes a method of encryption for data stored in sector-based
devices where the threat model includes possible access to stored data by the adversary.
Some characteristics of this standard include: the ciphertext is freely available for an
attacker, the data layout is not changed on the storage medium and in transit, and the
same plaintext is encrypted to different ciphertexts at different locations.
Selected IEE
Answer: E
 Question 59

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.
Selected product
Answer:
 Question 60
Five modes of operation have been standardized by NIST for use with symmetric block ciphers such as DES
and AES: electronic codebook mode, cipher block chaining mode, cipher feedback mode, __________, and
counter mode.
Selected output
Answer: feedback
 Question 61
Find the value of :
Selected Infinity mod 232
Answer: infinity mod 1234
infinity mod 1234

I believe there is no singular value

 Question 62
(a) - x = 2 ,5 and 8
(b) -x = 1 and 14
Selected X = -1, -2
Answer:
 Question 63
How many solution for :
911 x=1122 mod 115
9 x=211 mod 115
Selected 911 x = 87 implies X = 0.09
Answer: 9 x = 96 implies X = 10.66

 Question 64
Let S be the set of integers (positive, negative, and 0) under the usual operations of addition and
multiplication. S is an __________ domain.
Selected Integr
Answer: al
 Question 65
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.

Selected Tru
Answer: e
 Question 66
With AES what are the major Implementation considerations?
Selected Selecting the mode of the cipher. Electronic Code Block is the simplest 128 bit that performs
Answer: ideally the same encryption to the identical blocks making it vulnerable. ECB should be used
with counters to avoid this issue. Cipher block chaining is the most used random initialization
vector technique that doesn't jeopardize the process.
 Question 67

____________ have the following properties:

1. a = b (mod n) if n| (a - b)
2. a = b (mod n) implies b = a (mod n)
3. a = b (mod n) and b = c (mod n) imply a = c (mod n)

Selected Congruenc
Answer: es
 Question 68
A __________ takes as input a source that is effectively random
Selected h.
Answer: TRNG
 Question 69
Another important mode, XTS-AES, has been standardized by the __________ Security in Storage
Working Group.

Selected IEEE
Answer:
 Question 70
If the PRF does not generate effectively random 128-bit output values it may be possible for an
adversary to narrow the possibilities and successfully use a brute force attack.

Selected Tru
Answer: e
 Question 71

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.
Selected Unconditiona
Answer: lly
 Question 72

The OSI security architecture was not developed as an international standard,

therefore causing an obstacle for computer and communication vendors when
developing security features.
Selected Tru
Answer: e
 Question 73
A polynomial f(x) over a field F is called __________ if and only if f(x) cannot be expressed as a
product of two polynomials, both over F, and both of degree lower than that of f(x).
Selected irreducibl
Answer: e
 Question 74

Division requires that each nonzero element have a(n) __________ inverse.
Selected multiplicative
Answer:
 Question 75
Random numbers play an important role in the use of encryption for various network security
 applications.

Selected Tru
Answer: e
 Question 76
Affine Algorithm with Ciphertext of “VZQEQEVZAVQGARONIOOJUONY” will gives the Plaintext of
“this is the time for good work” when the keys are:
Selected c.
Answer: 17 and 10
 Question 77
Various methods of modifying a bit stream to reduce or eliminate a bias have been developed. These
are referred to as ___________ algorithms.

Selected deskewing
Answer:
 Question 78
The decryption
of “SIZUZAFSIDCSIZRZHBDMWPVGZMGDPZWDASIZGUNLASZ ESNAWSIZPZTDAWLPSDCLAWSI
ZPILCSQZSBZZANWONTZASUZSSZMPLASIZRZHBDMW” is "the length of the keyword
superposed on the Plaintext, and the second is to find the shift between adjacent letters in the
keyword" using Affine with keys:
Selected a.
Answer: 3 13
 Question 79

A scheme known as a one-time pad is unbreakable because it produces random

output that bears no statistical relationship to the plaintext.
Selected Tru
Answer: e
 Question 80
In AES, the arithmetic operations of addition, multiplication and division are performed over the finite
field _________ .
Selected GF(28)
Answer:
Monday, October 11, 2021 10:08:36 AM EDT
OK