Chapter 8 - Random Number Generation

Study online at https://quizlet.com/_akinxu

The principle requirement of random

or pseudorandom number generation is
True
that the generated number stream be
unpredictable.
Random numbers play an important role
True in the use of encryption for various net-
work security applications.
There are well-defined tests for deter-
mining uniform distribution and indepen-
False
dence to validate that a sequence of
numbers is random.
With true random sequences each num-
ber is statistically independent of other
True
numbers in the sequence and therefore
unpredictable.
The true random number generator may
True simply involve conversion of an analog
source to a binary output.
Examples of a pseudorandom function
True
are decryption keys and nonces.
If the PRF does not generate effectively
random 128-bit output values it may be
True possible for an adversary to narrow the
possibilities and successfully use a brute
force attack.
The purpose of the Maurer's universal
statistical test is to determine whether
the number of ones and zeros in a se-
False
quence are approximately the same as
would be expected for a truly random
sequence.
The seed that serves as input to the
True PRNG must be secure for cryptographic
applications.

1/5
Chapter 8 - Random Number Generation
Study online at https://quizlet.com/_akinxu
Three broad categories of cryptographic
algorithms are commonly used to create
True PRNGs: symmetric block ciphers, asym-
metric ciphers, and hash functions and
message authentication codes.
A widely used technique for pseudo-
random number generation is an algo-
True
rithm known as the linear congruential
method.
A cryptographically secure pseudoran-
False dom bit generator is defined as one that
passes the least significant bit test.
The security of Blum, Blum, Shub is
True
based on the difficulty of factoring n.
The stream cipher is similar to the
one-time pad with a difference being
False that a one-time pad uses a pseudoran-
dom number stream and a stream cipher
uses a genuine random number stream.
The longer the keyword the more difficult
True
the cryptanalysis.
A secret key for symmetric encryption
session key that is generated for use for a short peri-
od of time is called a _________ .
A __________ is used to produce a
PRF pseudorandom string of bits of some
fixed length
A source that is effectively random is
entropy source
referred to as a(n) __________ .
A __________ takes as input a source
TRNG
that is effectively random.
A pseudorandom number generator
seed takes as input a fixed value called the
__________ and produces a sequence

2/5
Chapter 8 - Random Number Generation
Study online at https://quizlet.com/_akinxu
of output bits using a deterministic algo-
rithm.
The best that can be done to determine
if a PRNG generates numbers that have
the characteristic of randomness is on
consistency
the basis of multiple tests. These tests
should seek to establish uniformity, scal-
ability, and __________ .
The __________ test is the most basic
frequency test of randomness and must be includ-
ed in any test suite.
The Blum, Blum, Shub generator is re-
CSPRBG
ferred to as a ____________ .
Two approaches that use a block cipher
CTR mode and OFB mode to build a PNRG and have gained wide-
spread acceptance are:
A __________ uses a nondeterministic
TRNG
source to produce randomness.
__________ is an open source project
for creating truly random numbers us-
LavaRnd
ing inexpensive cameras, open source
code, and inexpensive hardware.
Various methods of modifying a bit
stream to reduce or eliminate a bias have
deskewing
been developed. These are referred to
as ___________ algorithms.
The Linux operating system uses
four _________ entropy sources for generat-
ing random numbers.
In key distribution and reciprocal au-
thentication schemes two communicat-
ing parties cooperate by exchanging
nonces messages to distribute keys and/or au-
thenticate each other. In many cases
___________ are used for handshaking
to prevent replay attacks.
3/5
 Chapter 8 - Random Number Generation
Study online at https://quizlet.com/_akinxu

The distribution of bits in a random num-

ber sequence should be ___________ ,
uniform therefore the frequency of occurrence of
ones and zeros should be approximately
equal.
A __________ is a symmetric encryption
algorithm in which ciphertext output is
stream cipher
produced bit-by-bit or byte-by-byte from
a stream of plaintext input.
Typically the __________ takes as input
pseudorandom function (PRF) a seed plus some context specific values
such as a user ID or an application ID.
Two criteria used to validate that a se-
independence quence of numbers is random are uni-
form distribution and __________ .
The most important and widely used
RC4
stream cipher is __________ .
Two distinct requirements for a se-
randomness quence of random numbers are unpre-
dictability and __________ .
If the algorithm is good the resulting
sequences will pass many reasonable
pseudorandom
tests of randomness. These numbers are
referred to as ___________ numbers.
The __________ is drawn from the phys-
ical environment of the computer and
could include things such as keystroke
entropy source
timing patterns, disk electrical activity,
mouse movements, and instantaneous
values of the system clock.
An algorithm that is used to produce an
pseudorandom number generator
open-ended sequence of bits is referred
(PRNG)
to as a ___________ .
The purpose of the __________ test is to
runs
determine whether the number of runs of
4/5
Chapter 8 - Random Number Generation
Study online at https://quizlet.com/_akinxu
ones and zeros of various lengths is as
expected for a random sequence.
A stream of pseudorandom numbers
backward should exhibit two forms of unpredictabil-
ity: forward and __________ .
__________ algorithms are designed
purpose-built specifically and solely for the purpose of
generating pseudorandom bit streams.
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
keystream
of the generator, called a ___________
, is combined one byte at a time with the
plaintext stream using the bitwise exclu-
sive-OR operation.
__________ is a stream cipher designed
RC4
in 1987 by Ron Rivest for RSA Security.
Operating systems typically provide
a built-in mechanism for generat-
ing random numbers. For example,
linux
__________ uses mouse and keyboard
activity, disk I/O operations, and specific
interrupts.
A fundamental requirement of the RSA
prime public-key encryption scheme is the abil-
ity to generate _________ numbers.

5/5