Make sure you get all these questions correct!

1.Determine the number of bit positions that are active and can also affect L[0, 0] in the Lota step function.

2.Each bit value changes in the Theta step function, which is a substitution step. Determine the number of bits that each bit is dependent on for its new value.

3.Given the definition of the Rho function which is represented as a[x, y, z] a[x, y, z-g(t)], solve for g(t).

4.Give a brief description of the representation of the Pi step function.

5.Determine the truth value given that there is a round constant which only works on the last lane in the Lota step function in the SHA-3.

6.State and describe the matrix that is used in the Rho/Pi steps.

7.Give the definition of the Chi function in terms of how it is represented.

8.Determine two gate operations that are involved in the CHI step.

9.Define the only step function that is capable of providing non- linear mapping.

10.Determine the step function that provides the most amount of diffusion for the Keccak iteration step.