adplus-dvertising
frame-decoration

Question

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

a.

3

b.

4

c.

5

d.

6

Answer: (c).5

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

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

Similar Questions

Discover Related MCQs

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

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

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

Q. The sponge construction involves 2 phases, these are

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

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

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

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

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

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.

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

Q. The Pi step function can be written as-

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

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

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

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

Q. The Chi function is defined as

Q. In SHA-3, the Iota step function has a round constant which only works on the last lane.

Q. Which is the only step function that provides non-linear mapping?

Q. How many bit positions are active and can affect L[0, 0] in the Iota step function?