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

CRYPTOGRAPHY AND NETWORK SECURITY - DATA ENCRYPTION STANDARD MCQ

• 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) ?
• 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, the output of the SP network for the plaintext: 101110001 is
• 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
• Which of the following slows the cryptographic algorithm
• DES follows
• The DES Algorithm Cipher System consists of ____________rounds (iterations) each with a round key
• The DES algorithm has a key length of
• 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
• The number of unique substitution boxes in DES after the 48 bit XOR operation are
• In the DES algorithm the 64 bit key input is shortened to 56 bits by ignoring every 4th bit
• During decryption, we use the Inverse Initial Permutation (IP-1) before the IP
• A preferable cryptographic algorithm should have a good avalanche effect
• The number of tests required to break the DES algorithm are
• The number of tests required to break the Double DES algorithm are
• How many keys does the Triple DES algorithm use?
• In triple DES, the key size is ___ and meet in the middle attack takes ___ tests to break the key
• Using Differential Crypt-analysis, the minimum computations required to decipher the DES algorithm is
• Using Linear Crypt-analysis, the minimum computations required to decipher the DES algorithm is
• What is the size of the key in the SDES algorithm?
• Assume input 10-bit key, K: 1010000010 for the SDES algorithm. What is K1?
• Assume input 10-bit key, K: 1010000010 for the SDES algorithm. What is K2?
• The Ciphertext for the Plaintext 01110010, given that the keys K1 is 10100100 and K2 is 01000011 is
• The Ciphertext for the Plaintext 11010101, given that the key is 0111010001 is
• The Plaintext for the Ciphertext 00100010, given that the key is 1111111111 is
• In SDES, Encryption algorithm can be written as a composition of functions:
• Assume input 10-bit key, K: 0010010111 for the SDES algorithm. What is K1?
• The Plaintext for the Ciphertext 00001111, given that the key is 1111111111 is
• The Plaintext for the Ciphertext 11110000, given that the key is 0000000000 is
• Assume input 10-bit key, K: 0010010111 for the SDES algorithm. What is K2?
• The Plaintext for the Ciphertext 10100101, given that the key is 0010010111 is

This question belongs to these collections

• CRYPTOGRAPHY AND NETWORK SECURITY - DATA ENCRYPTION STANDARD MCQ

Similar questions