FiltersDone

Question type

Essay

Multiple Choice

Short Answer

True False

Matching

Exam 11: Cryptographic Hash Functions

Show Answer

Share

---

All types

Filters

Study FlashcardsPractice ExamLearn

Question 1

Short Answer

Review LaterAdd Note

Review Later

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

Correct Answer

verified

Show Answer

Question 2

Multiple Choice

Review LaterAdd Note

Review Later

A ___________ is an algorithm for which it is computationally infeasible to find either (a) a data object that maps to a pre-specified hash result or (b) two data objects that map to the same hash result.

A) cryptographic hash function
B) strong collision resistance
C) one-way hash function
D) compression function

Correct Answer

verified

Show Answer

Question 3

Multiple Choice

Review LaterAdd Note

the cryptographic hash function requirement that guarantees that it is impossible to find an alternative message with the same hash value as a given message and prevents forgery when an encrypted hash code is used is the ___________ .

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.

SHA-1 produces a hash value of __________ bits.

the hash value of a message in the __________ application is encrypted with a user's private key.

Hash functions are commonly used to create a one-way password file.

__________ is a mechanism or service used to verify the integrity of a message.

Encryption hardware is optimized toward smaller data sizes.

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

the Secure Hash Algorithm design closely models, and is based on, the hash function __________ .

the most widely used hash function has been the Whirlpool.

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

A __________ is an attack based on weaknesses in a particular cryptographic algorithm.

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

the SHA-512 algorithm has the property that every bit of the hash code is a function of every bit of the input.

It can be shown that some form of birthday attack will succeed against any hash scheme involving the use of cipher block chaining without a secret key, provided that either the resulting hash code is small enough or that a larger hash code can be decomposed into independent subcodes.

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

A ___________ accepts a variable length block of data as input and produces a fixed size hash value h = H(M) .

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