Q. A rule to check for a large number N being a prime number

View solution

Q. PRNGs are derived through algorithms.

View solution

Q. TRNGs take in an input which is referred to as

View solution

Q. PRNGs take in an input which is referred to as

View solution

Q. Which of the following produces an output of fixed length?

View solution

Q. Which of the following a is NOT a check for randomness?

View solution

Q. The property that there should be equally likely number of 1s and 0s in a Pseudo Random Number sequence is

View solution

Q. The property that any extracted subsequence should pass the test for randomness is

View solution

Q. Which among the following cannot be used in the case of stream ciphers?

View solution

Q. A stream cipher key is usually of size ___ or 128 bits.

View solution

Q. Which among the following has the lowest bitrate ?

View solution

Q. RC4 was built on the sole purpose of generating random bits i.e. to act as a PRNG.

View solution

Q. Maurer’s Universal Statistical Test is –

View solution

Q. Runs Test is

View solution

Q. Frequency Test is

View solution

Q. We should not be able to determine the seed from any previous knowledge of the bits sequence. This is the property of backward unpredictability.

View solution

Q. Forward Unpredictability is a property when the seed is unknown, and the next output bit is the sequence should be unpredictable.

View solution

Q. Using the Linear Congruential Method (LCM), for a=7, c=0 and m=32. The period is

View solution

Q. Using the Linear Congruential Method, for a=5, c=0 and m=32. The period is

View solution

Q. The appropriate value for m (in LCM) is

View solution