Q. The Rho function is defined as : a[x, y, z] ← a[x, y, z-g(t)], where g(t) is defined as

View solution

Q. What are the new co-ordinates for (x, y) in the Rho step for t =3?

View solution

Q. Which matrix is used in the Rho/ Pi steps?

View solution

Q. The CHI step involves which of the following gate operations?

View solution

Q. The Pi step function can be written as-

View solution

Q. Which step function provides most amount of diffusion for the Keccak iteration step?

View solution

Q. In the Theta step function, which is a substitution step, each bit value changes. Each bit is dependent on _________ other bits for its new value.

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

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

View solution

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

View solution

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

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. The sponge construction involves 2 phases, these are

View solution

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

View solution

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

View solution

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

View solution

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

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. 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. The default values for Keccak f are

View solution