Q. A larger hash code cannot be decomposed into independent subcodes.

View solution

Q. We define collision as: A collision occurs if we have x=y and H(x) = H(y).

View solution

Q. Consider the following properties:

Variable Input size
Fixed Output size
Efficiency
Pre image resistant
Second Pre image Resistant
Collision resistant
Pseudo randomness

A has function that satisfies the first _______ properties in the above table is referred to as a weak hash function.

View solution

Q. A function that is second pre-image resistant is also collision resistant.

View solution

Q. Which attack requires the least effort/computations?

View solution

Q. SHA-1 produces a hash value of

View solution

Q. What is the number of round computation steps in the SHA-256 algorithm?

View solution

Q. In SHA-512, the message is divided into blocks of size ___ bits for the hash computation.

View solution

Q. What is the maximum length of the message (in bits) that can be taken by SHA-512?

View solution

Q. The message in SHA-512 is padded so that it’s length is

View solution

Q. The big-endian format is one in which

View solution

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