Pseudorandom Number Generation and Stream Ciphers and More Block Ciphers

This is a computer science engineering quiz on cryptography and network security, which includes questions on Pseudorandom Number Generation and Stream Ciphers and More Block Ciphers.

Start Quiz

How many computation rounds does the simplified AES consists of?

5 2 8 10

For the case of Mixed Columns and Inverse Mixed Columns, is it true that b(x) = a-1(x)mod(x4 + 1) where a(x) = {03}x3 + {01}x2 + {01}x + {02} and b(x) = {0B}x3 + {0D}x2 + {09}x + {0E}

True False. The expression for a(x) is wrong. False. The expression for b(x) is wrong. False. Both a(x) and b(x) are faulty.

For an inputs key of size 128 bits constituting of all zeros, what is w(7) ?

{62 63 63 63} {62 62 62 62} {00 00 00 00} {63 63 63 62}

On comparing AES with DES, which of the following functions from DES does not have an equivalent AES function?

f function permutation p swapping of halves xor of subkey with function f

What is the block size in the Simplified AES algorithm?

8 bits 40 bits 16 bits 36 bits

What is the key size in the S-AES algorithm?

16 bits 32 bits 24 bits None of the mentioned

Which of the following is a faulty S-AES step function?

Add round key Byte substitution Shift rows Mix Columns

A CSPRBG is defined as one that passes the __ test.

Runs test Maurer’s Universal statistical test Frequency Test On-bit test

Find the first 8 bits for Blum Blum Shub Bit Generator when seed = 101355 and n = 192649.

10101010 11100010 11001011 11001110

On perform the Mix Columns transformation for the sequence of bytes “77 89 AB CD” we get output:

{01 55 EE 4A}

{0A 44 EF 4A}

{08 55 FF 3A}

{09 44 DD 4A}

For the cipher text 0000 0111 0011 1000 and Key 0110 1111 0110 1011, apply the Simplified AES to obtain the plaintext. The plain text is:

0110 1001 0111 0001

0110 1111 0110 1011

0010 1001 0110 1011

1111 0101 0111 1111

S-AES and S-DES were both developed by the same person as an educational cryptography system to teach students:

True

False

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

13

4

11

7

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

8

4

9

11

The appropriate value for m (in LCM) is:

2^(31) – 1

2^(31)

2^(32)

2^(32) – 1

Quiz/Test Summary
Title: Pseudorandom Number Generation and Stream Ciphers and More Block Ciphers
Questions: 15
Contributed by:
james