For a 100 bit key and a 32 bit tag, how many possible keys can be produced in the 3rd round?(a) 2^4(b) 2^32(c) 2^16(d) 2^64I have been asked this question in a job interview.Query is from Message Authentication Codes (MACs) topic in section Message Authentication Codes, Whirlpool Algorithm and Key Management and Distribution of Cryptograph & Network Security

For a 100 bit key and a 32 bit tag, how many possible keys can be prod

1.	For a 100 bit key and a 32 bit tag, how many possible keys can be produced in the 3rd round?(a) 2^4(b) 2^32(c) 2^16(d) 2^64I have been asked this question in a job interview.Query is from Message Authentication Codes (MACs) topic in section Message Authentication Codes, Whirlpool Algorithm and Key Management and Distribution of Cryptograph & Network Security
Answer» Correct answer is (a) 2^4 Easy explanation: First round: 100 – 32 = 68 Second round: 68 – 32 = 36. Third round: 36 – 32 = 4. Therefore 2^4 keys can be PRODUCED by the third round.

Discussion

No Comment Found

Related InterviewSolutions

X.509 certificate recommends which cryptographic algorithm?(a) RSA(b) DES(c) AES(d) RabinThe question was asked in an interview.My query is from Public Keys and X.509 Certificates-III topic in chapter Message Authentication Codes, Whirlpool Algorithm and Key Management and Distribution of Cryptograph & Network Security
Given a message and its n-bit hash result, the expected workload of finding a message that hashes to the same value is of the order _______________(a) 2^(n/2)(b) 2^(n-1)(c) 2^(n)(d) 2^(2n)I got this question during an internship interview.The doubt is from Whirlpool Algorithm topic in chapter Message Authentication Codes, Whirlpool Algorithm and Key Management and Distribution of Cryptograph & Network Security
When the Round Constant is given by S[8(r-1)+j]. What are the limits of ‘i’ and ‘j’?(a) i = 1 ; 0
MACs are also called(a) testword(b) checkword(c) testbits(d) none of the mentionedThis question was addressed to me in exam.My question is taken from Message Authentication Codes (MACs) in portion Message Authentication Codes, Whirlpool Algorithm and Key Management and Distribution of Cryptograph & Network Security
How many functions are involved in the PKIX architectural model?(a) 3(b) 5(c) 6(d) 7The question was asked in an online interview.I want to ask this question from Public Keys and X.509 Certificates-III topic in chapter Message Authentication Codes, Whirlpool Algorithm and Key Management and Distribution of Cryptograph & Network Security
Which systems use a timestamp?i) Public-Key Certificatesii) Public announcementsiii) Publicly available directoriesiv) Public-Key authority(a) i) and ii)(b) iii) and iv)(c) i) and iv)(d) iv) onlyI got this question in an interview for job.The question is from Public Keys and X.509 Certificates-I topic in section Message Authentication Codes, Whirlpool Algorithm and Key Management and Distribution of Cryptograph & Network Security
Which of the following public key distribution systems is most secure?(a) Public-Key Certificates(b) Public announcements(c) Publicly available directories(d) Public-Key authorityThe question was asked in unit test.This interesting question is from Public Keys and X.509 Certificates-I in division Message Authentication Codes, Whirlpool Algorithm and Key Management and Distribution of Cryptograph & Network Security
USENET is related to which of the following Public Key distribution schemes?(a) Public-Key Certificates(b) Public announcements(c) Publicly available directories(d) Public-Key authorityI got this question in an interview for internship.I would like to ask this question from Public Keys and X.509 Certificates-I topic in division Message Authentication Codes, Whirlpool Algorithm and Key Management and Distribution of Cryptograph & Network Security
Which session key is used for electronic funds transfer and point of sale applications?(a) Data-encrypting key(b) File-encrypting key(c) PIN-encrypting key(d) None of the mentionedI have been asked this question in an interview for internship.This intriguing question originated from Symmetric Key Distribution in division Message Authentication Codes, Whirlpool Algorithm and Key Management and Distribution of Cryptograph & Network Security
Which algorithm has the most execution latency?(a) SHA-1(b) SHA-2(c) MD-5(d) WhirlpoolI got this question at a job interview.This is a very interesting question from Whirlpool Algorithm in portion Message Authentication Codes, Whirlpool Algorithm and Key Management and Distribution of Cryptograph & Network Security

Discussion

No Comment Found

Related InterviewSolutions

Reply to Comment