Question
a.
f(m1) + f(m2) + t
b.
f(m1) + f(m2) + 2t
c.
f(m1) + t
d.
f(m1) + f(m2)
Posted under Cryptography and Network Security
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. In affine block cipher systems if f(m)=Am + t, what is f(m1+m2) ?
Similar Questions
Discover Related MCQs
Q. In affine block cipher systems if f(m)=Am + t, what is f(m1+m2+m3) ?
View solution
Q. What is the number of possible 3 x 3 affine cipher transformations ?
View solution
Q. Super-Encipherment using two affine transformations results in another affine transformation.
View solution
Q. If the key is 110100001, the output of the SP network for the plaintext: 101110001 is
View solution
Q. 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
View solution
Q. Confusion hides the relationship between the ciphertext and the plaintext.
View solution
Q. The S-Box is used to provide confusion, as it is dependent on the unknown key.
View solution
Q. Which of the following slows the cryptographic algorithm –
1) Increase in Number of rounds
2) Decrease in Block size
3) Decrease in Key Size
4) Increase in Sub key Generation
View solution
Q. DES follows
View solution
Q. The DES Algorithm Cipher System consists of ____________rounds (iterations) each with a round key
View solution
Q. The DES algorithm has a key length of
View solution
Q. In the DES algorithm, although the key size is 64 bits only 48bits are used for the encryption procedure, the rest are parity bits.
View solution
Q. In the DES algorithm the round key is __________ bit and the Round Input is ____________bits.
View solution
Q. In the DES algorithm the Round Input is 32 bits, which is expanded to 48 bits via ____________
View solution
Q. The Initial Permutation table/matrix is of size
View solution
Q. The number of unique substitution boxes in DES after the 48 bit XOR operation are
View solution
Q. In the DES algorithm the 64 bit key input is shortened to 56 bits by ignoring every 4th bit.
View solution
Q. During decryption, we use the Inverse Initial Permutation (IP-1) before the IP.
View solution
Q. A preferable cryptographic algorithm should have a good avalanche effect.
View solution
Q. The number of tests required to break the DES algorithm are
View solution
Suggested Topics
Are you eager to expand your knowledge beyond Cryptography and Network Security? We've curated a selection of related categories that you might find intriguing.
Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!
.png)
