Q. In SHA-512, the registers ‘a’ to ‘h’ are obtained by taking the first 64 bits of the fractional parts of the cube roots of the first 8 prime numbers.

View solution

Q. What is the size of W (in bits) in the SHA-512 processing of a single 1024- bit block?

View solution

Q. In the SHA-512 processing of a single 1024- bit block, the round constants are obtained

View solution

Q. The output of the N 1024-bit blocks from the Nth stage is

View solution

Q. Among the registers ‘a’ to ‘h’ how many involve permutation in each round?

View solution

Q. The registers ‘a’ and ‘e’ involve

View solution

Q. In SHA-512, W16 is dependent on

View solution

Q. What is the number of operation required to come up with 2 messages having the same message digest in SHA-512?

View solution

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