This is a computer science engineering quiz on cryptography and network security, which includes questions on Block Ciphers and the Data Encryption Standard.
In affine block cipher systems if f(m)=Am + t, what is f(m1+m2) ?
In affine block cipher systems if f(m)=Am + t, what is f(m1+m2+m3) ?
If the block size is ‘s’, how many affine transformations are possible ?
What is the number of possible 3 x 3 affine cipher transformations ?
Super-Encipherment using two affine transformations results in another affine transformation.
If the key is 110100001 where, If ki=0, then S_i (x)=((1 1 0 | 0 1 1 | 1 0 0 ))x+((1 1 1)) and If ki=1, then S_i (x)=((0 1 1 | 1 0 1 | 1 0 0))x+((0 1 1)) then the output of the SP network for the plaintext: 101110001 is
Confusion hides the relationship between the ciphertext and the plaintext.
The S-Box is used to provide confusion, as it is dependent on the unknown key.
In the DES algorithm, although the key size is 64 bits only 48bits are used for the encryption procedure, the rest are parity bits.
In the DES algorithm the round key is __________ bit and the Round Input is ____________bits.
In the DES algorithm the Round Input is 32 bits, which is expanded to 48 bits via ____________
The Initial Permutation table/matrix is of size:
16×8
12×8
8×8
4×8
DES follows:
Hash Algorithm
Caesars Cipher
Feistel Cipher Structure
SP Networks
The DES Algorithm Cipher System consists of ____________rounds (iterations) each with a round key.
12
18
9
16
The DES algorithm has a key length of:
128 Bits
32 Bits
64 Bits
16 Bits