IAS CH7 QUIZ

The principle requirement of random or pseudorandom number

generation is that the generated number stream be unpredictable.

• T

• F

Random numbers play an important role in the use of encryption

for various network security applications.

• T

• F

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

unpredictable.

• T

• F

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

• T

• F

Examples of a pseudorandom function are decryption keys and

nonces.

• T

• F

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.

• T

• F

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.

• T

• F

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

• T

• F

Three broad categories of cryptographic algorithms are commonly used to create PRNGs: symmetric block ciphers, asymmetric

ciphers, and hash functions and message authentication codes.

• T

• F

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

• T

• F