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.
How many computation rounds does the simplified AES consists of?
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}
For an inputs key of size 128 bits constituting of all zeros, what is w(7) ?
On comparing AES with DES, which of the following functions from DES does not have an equivalent AES function?
What is the block size in the Simplified AES algorithm?
What is the key size in the S-AES algorithm?
Which of the following is a faulty S-AES step function?
A CSPRBG is defined as one that passes the __ test.
Find the first 8 bits for Blum Blum Shub Bit Generator when seed = 101355 and n = 192649.
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