Deck 8: Random Bit Generation and Stream Ciphers

Question 1

there are well-defined tests for determining uniform distribution
and independence to validate that a sequence of numbers is
random.

Answer 1

False

Question 2

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.

Answer 2

True

Question 3

A widely used technique for pseudorandom number generation is
an algorithm known as the linear congruential method.

Answer 3

True

Question 4

A __________ takes as input a source that is effectively random.

A)PRF
B)BBS
C)PRNG
D)tRNG

Question 5

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.

Question 6

the principle requirement of random or pseudorandom number
generation is that the generated number stream be unpredictable.

Question 7

three broad categories of cryptographic algorithms are commonly
used to create PRNGs: symmetric block ciphers, asymmetric
ciphers, and hash functions and message authentication codes.

Question 8

Random numbers play an important role in the use of encryption
for various network security applications.

Question 9

With true random sequences each number is statistically
independent of other numbers in the sequence and therefore
unpredictable.

Question 10

A __________ is used to produce a pseudorandom string of bits of some fixed length.

A)PRF
B)PRNG
C)OFB PRNG
D)tRNG

Question 11

A pseudorandom number generator takes as input a fixed value called the __________ and produces a sequence of output bits using a deterministic algorithm.

A)seed
B)fixed skew
C)entropy source
D)keystream

Question 12

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.

Question 13

the seed that serves as input to the PRNG must be secure for
cryptographic applications.

Question 14

A cryptographically secure pseudorandom bit generator is defined
as one that passes the least significant bit test.

Question 15

the longer the keyword the more difficult the cryptanalysis.

Question 16

A source that is effectively random is referred to as __________ .

A)an open source
B)an entropy source
C)a keystream
D)a seed

Question 17

Examples of a pseudorandom function are decryption keys and
nonces.

Question 18

the security of Blum, Blum, Shub is based on the difficulty of
factoring n.

Question 19

A secret key for symmetric encryption that is generated for use for a short period of time is called a _________ .

A)strategic key
B)sequence key
C)session key
D)stream key

Question 20

the true random number generator may simply involve conversion
of an analog source to a binary output.

Question 21

the most important and widely used stream cipher is __________ .

Question 22

If the algorithm is good the resulting sequences will pass many reasonable tests of randomness.these numbers are referred to as ___________ numbers.

Question 23

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 __________ .

A)consistency
B)authentication
C)frequency
D)sequencing

Question 24

An algorithm that is used to produce an open-ended sequence of bits is referred to as a ___________ .

Question 25

two approaches that use a block cipher to build a PNRG and have gained widespread acceptance are:

A)CtR mode and CFB mode
B)CtR mode and OFB mode
C)CBC mode and CFB mode
D)OFB mode and ECB mode

Question 26

the __________ is drawn from the physical environment of the computer and could include things such as keystroke timing patterns, disk electrical activity, mouse movements, and instantaneous values of the system clock.

Question 27

the purpose of the __________ test is to determine whether the number of runs of ones and zeros of various lengths is as expected for a random sequence.

Question 28

A __________ uses a nondeterministic source to produce randomness.

A)CSPRBG
B)tRNG
C)PRNG
D)BBS

Question 29

the __________ test is the most basic test of randomness and must be included in any test suite.

A)frequency
B)runs
C)unpredictability
D)Maurer

Question 30

Various methods of modifying a bit stream to reduce or eliminate a bias have been develope D.these are referred to as ___________ algorithms.

A)backward
B)deskewing
C)forward
D)keystream

Question 31

__________ is an open source project for creating truly random numbers using inexpensive cameras, open source code, and inexpensive hardware.

A)LavaRnd
B)Blum, Blum, Shub
C)Maurer's statistics
D)Entropy

Question 32

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.

A)session keys
B)nonces
C)RC4s
D)entropies

Question 33

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.

Question 34

typically the __________ takes as input a seed plus some context specific values such as a user ID or an application ID.

Question 35

the Blum, Blum, Shub generator is referred to as a ____________ .

A)tRNG
B)OFB PRNG
C)QRN
D)CSPRBG

Question 36

two criteria used to validate that a sequence of numbers is random are uniform distribution and __________ .

Question 37

the Linux operating system uses _________ entropy sources for generating random numbers.

A)four
B)three
C)one
D)two

Question 38

two distinct requirements for a sequence of random numbers are unpredictability and __________ .

Question 39

A stream of pseudorandom numbers should exhibit two forms of unpredictability: forward and __________ .

Question 40

the distribution of bits in a random number sequence should be ___________ , therefore the frequency of occurrence of ones and zeros should be approximately equal.

A)independent
B)uniform
C)reversed
D)streamed

Question 41

__________ algorithms are designed specifically and solely for the purpose of generating pseudorandom bit streams.

Question 42

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.

Question 43

A fundamental requirement of the RSA public-key encryption scheme is the ability to generate _________ numbers.

Question 44

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.

Question 45

__________ is a stream cipher designed in 1987 by Ron Rivest for RSA Security.