Q. The key Wrapping Algorithm provides confidentiality and data integrity.

View solution

Q. Which of the following is not true for whirlpool hashing function?

View solution

Q. The expected workload of generating a collision is of the order of ____________ executions of Whirlpool.

View solution

Q. Given a message, the expected workload of finding a message that hashes to that value is of the order ____________

View solution

Q. 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 _______________

View solution

Q. The message is padded to

View solution

Q. The length of the message is appended to the message. What is the size of this length?

View solution

Q. The hash matrix is of the size

View solution

Q. The 8 × 8 hash matrix holds values of size

View solution

Q. The hash matrix of 8 × 8 is preferred over a 16 × 4 matrix because

View solution

Q. How many rounds are there in one Whirlpool Iteration?

View solution

Q. Which one of these is not a Whirlpool function?

View solution

Q. What is the correct order of operation within each round of the Whirlpool algorithm?

View solution

Q. What is the size of the s-box table/matrix in Whirlpool?

View solution

Q. The S-box implements linear mapping thus providing diffusion.

View solution

Q. Another name for the Whirlpool key is

View solution

Q. How many round constants (RCs) are required in Whirlpool?

View solution

Q. The Round Constant is dependent on the s-box values.

View solution

Q. The Round Constant is given by S[8(r-1)+j]. What are the limits of ‘r’?

View solution

Q. When the Round Constant is given by S[8(r-1)+j]. What are the limits of ‘i’ and ‘j’?

View solution