Exam 11: Cryptographic Hash Functions

A message authentication code is also known as a __________ hash function.

Virtually all cryptographic hash functions involve the iterative use of a compression function.

The most important and widely used family of cryptographic hash functions is the __________ family.

The Secure Hash Algorithm was developed by the ___________ .

__________ are measures of the number of potential collisions for a given hash value.

Three new versions of SHA with hash value lengths of 256,384,and 512 bits are collectively known as __________ .

SHA-1 produces a hash value of __________ bits.

Limited characteristics make it impossible for hash functions to be used to determine whether or not data has changed.

If collision resistance is required the value _________ determines the strength of the hash code against brute-force attacks.

Message authentication is achieved using a __________ .

The hash algorithm involves repeated use of a __________ function,f,that takes two inputs an n-bit input and a b-bit block)and produces an n-bit output.

The __________ resistant guarantees that it is impossible to find an alternative message with the same hash value as a given message.

The kind of hash function needed for security applications is referred to as a __________ hash function.

The evaluation criteria for SHA-3 are security,___________,and algorithm and implementation characteristics.

The effort required for a collision resistant attack is explained by a mathematical result referred to as the ___________ .

Hash functions can be used for intrusion and virus detections.

The two categories of attacks on hash functions are __________ attacks and cryptanalysis.

An ideal hash algorithm will require a cryptanalytic effort __________ the brute-force effort.

When a hash function is used to provide message authentication,the hash function value is often referred to as a ___________ .

SHA-1 is very similiar in structure and in the basic mathematical operations used to __________ and SHA-0.