Welcome to the Pseudorandom Number Generation and Stream Ciphers MCQs Page

Dive deep into the fascinating world of Pseudorandom Number Generation and Stream Ciphers with our comprehensive set of Multiple-Choice Questions (MCQs). This page is dedicated to exploring the fundamental concepts and intricacies of Pseudorandom Number Generation and Stream Ciphers, a crucial aspect of Cryptography and Network Security. In this section, you will encounter a diverse range of MCQs that cover various aspects of Pseudorandom Number Generation and Stream Ciphers, from the basic principles to advanced topics. Each question is thoughtfully crafted to challenge your knowledge and deepen your understanding of this critical subcategory within Cryptography and Network Security.

Check out the MCQs below to embark on an enriching journey through Pseudorandom Number Generation and Stream Ciphers. Test your knowledge, expand your horizons, and solidify your grasp on this vital area of Cryptography and Network Security.

Note: Each MCQ comes with multiple answer choices. Select the most appropriate option and test your understanding of Pseudorandom Number Generation and Stream Ciphers. You can click on an option to test your knowledge before viewing the solution for a MCQ. Happy learning!

Pseudorandom Number Generation and Stream Ciphers MCQs | Page 2 of 9

Explore more Topics under Cryptography and Network Security

01

Cryptography Basics

02

Encryption Techniques

03

Data Encryption Standard

04

Number Theory and Finite Fields

05

Advanced Encryption Algorithm

06

Public Key Cryptography and RSA

07

Cryptographic Hash Functions

08

Message Authentication Codes and Key Management

09

Network Security Concepts

10

Security in the Internet

11

Wireless Network Security

Q11.

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

TRNGs

PRNGs

PRFs

All of the mentioned

Discuss

Answer: (a).TRNGs

Q12.

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

Discuss

Answer: (c).54

Q13.

Which among the following has the lowest bitrate ?

PRF

TRNG

PRNG

All have the same bitrate

Discuss

Answer: (b).TRNG

Q14.

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

True

False

May be

Can't say

Discuss

Answer: (a).True

Q15.

Maurer’s Universal Statistical Test is –

a test to determine whether the number of runs of ones and zeros of various lengths is as expected

a test to detect if a sequence can be significantly compressed without loss of information

a test to determine whether the number of ones and zeros in a sequence is approx the same as in a truely random o/p

a test for the check of evenness in the 1s and 0s

Discuss

Answer: (b).a test to detect if a sequence can be significantly compressed without loss of information

Q16.

Runs Test is

a test to determine whether the number of runs of ones and zeros of various lengths is as expected

a test to detect if a sequence can be significantly compressed without loss of information

a test to determine whether the number of ones and zeros in a sequence is approx the same as in a truely random o/p

a test for the check of evenness in the 1s and 0s

Discuss

Answer: (a).a test to determine whether the number of runs of ones and zeros of various lengths is as expected

Q17.

Frequency Test is

a test to determine whether the number of runs of ones and zeros of various lengths is as expected

a test to detect if a sequence can be significantly compressed without loss of information

a test for the check of evenness in the 1s and 0s

a test to determine whether the number of ones and zeros in a sequence is approx the same as in a truely random o/p

Discuss

Answer: (d).a test to determine whether the number of ones and zeros in a sequence is approx the same as in a truely random o/p

Q18.

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

True

False

May be

Can't say

Discuss

Answer: (a).True

Q19.

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

True

False

May be

Can't say

Discuss

Answer: (a).True

Q20.

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

Discuss

Answer: (b).4

Page 2 of 9

Welcome to the Pseudorandom Number Generation and Stream Ciphers MCQs Page

Pseudorandom Number Generation and Stream Ciphers MCQs | Page 2 of 9

Explore more Topics under Cryptography and Network Security

Cryptography Basics

Encryption Techniques

Data Encryption Standard

Number Theory and Finite Fields

Advanced Encryption Algorithm

Public Key Cryptography and RSA

Cryptographic Hash Functions

Message Authentication Codes and Key Management

Network Security Concepts

Security in the Internet

Wireless Network Security

Suggested Topics

Computer Graphics

Digital Logic Design

Cyber Security

DBMS

Management Information Systems

Big Data Computing

Software Architecture and Design

Discrete Mathematics

Data Structures and Algorithms