Q. The underlying structure of the SHA-3 algorithm is referred to as

View solution

Q. SHA-3 allows variable length input and output.

View solution

Q. Multi-rate padding is denoted by

View solution

Q. In SHA-3, if the desired output is l bits, then j blocks are produced, such that

View solution

Q. In the sponge construction, the value ‘c’ is known as

View solution

Q. The larger the value of ‘r’, the lesser the rate at which message bits are processed by the sponge construction.

View solution

Q. We can trade security for speed by

View solution

Q. The default values for Keccak f are

View solution

Q. In SHA-3, which step function does the operation L[2,3] <- L[2,3] XOR NOT(L[3,3]) AND L[4,3] represent?

View solution

Q. In SHA-3, which function does the operation L[2,3]<- C[1] XOR L[2,3] XOR ROT(C[3],1) represent?

View solution

Q. How many rounds are present in each iteration function of SHA-3?

View solution

Q. In SHA-3, which step function does not affect W [0, 0]?

View solution

Q. Which among the following is not a substitution operation?

View solution

Q. In SHA-3, for a message digest size of 256, what is the bitrate ‘r’ (capacity = 512) ?

View solution

Q. The sponge construction involves 2 phases, these are

View solution

Q. Within the Keccak function-f, the 1600 bits are arranged into a 5 x 5 x 64 array a. The 64-bit units are referred to as

View solution

Q. What are the co-ordinates of the bottom-right most lane?

View solution

Q. How many iterations / rounds does the Keccak function have ?

View solution

Q. Which step function works only W[0, 0]?

View solution

Q. SHA-3 has an advantage over other algorithms because, there is no need for table look ups, arithmetic operations or data dependent operations.

View solution