# Quiz 11: Cryptographic Hash Functions

Computing

Q 1Q 1

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

Free

True False

True

Q 2Q 2

A good hash function has the property that "the results of applying
the function to a large set of inputs will produce outputs that are
evenly distributed and apparently random".

Free

True False

True

Q 3Q 3

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

Free

True False

False

Free

True False

Free

True False

Free

True False

Free

True False

Free

True False

Free

True False

Q 10Q 10

A weak hash function is sufficient to protect against an attack in
which one party generates a message for another party to sign.

Free

True False

Q 11Q 11

the way to measure the resistance of a hash algorithm to
cryptanalysis is to compare its strength to the effort required for a
brute-force attack.

Free

True False

Q 12Q 12

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.

Free

True False

Free

True False

Free

True False

Q 15Q 15

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

Free

True False

Q 16Q 16

the principal object of a hash function is __________ .
A)data integrity
B)compression
C)collision resistance
D)mapping messages

Free

Multiple Choice

Q 17Q 17

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

Free

Multiple Choice

Q 18Q 18

the Secure Hash Algorithm design closely models, and is based on, the hash function __________ .
A)MD5
B)FIPS 180
C)RFC 4634
D)MD4

Free

Multiple Choice

Q 19Q 19

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

Free

Multiple Choice

Q 20Q 20

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 ___________ .
A)collision resistant
B)pseudorandomness
C)preimage resistant
D)second preimage resistant

Free

Multiple Choice

Q 21Q 21

__________ is a mechanism or service used to verify the integrity of a message.
A)Message authentication
B)Data compression
C)Data mapping
D)Message digest

Free

Multiple Choice

Free

Multiple Choice

Q 23Q 23

__________ are measures of the number of potential collisions for a given hash value.
A)MACs
B)Primitives
C)Hash codes
D)Preimages

Free

Multiple Choice

Q 24Q 24

A hash function that satisfies the properties of variable input size, fixed output size, efficiency, preimage resistant and second preimage resistant is referred to as a __________.
A)strong hash function
B)collision resistant function
C)weak hash function
D)preimage resistant function

Free

Multiple Choice

Q 25Q 25

the effort required for a collision resistant attack is explained by a mathematical result referred to as the ___________ .
A)Whirlpool
B)birthday paradox
C)hash value
D)message authentication code

Free

Multiple Choice

Q 26Q 26

An ideal hash algorithm will require a cryptanalytic effort __________ the brute-force effort.
A)less than or equal to
B)greater than or equal to
C)less than
D)greater than

Free

Multiple Choice

Free

Multiple Choice

Free

Multiple Choice

Q 29Q 29

"Given a hash function H, with n possible outputs and a specific value H(x), if H is applied to k random inputs, what must be the value of k so that the probability that at least one input y satisfies H(y) = H(x) is 0.5" is a reference to the __________ .
A)authentication code
B)collision resistant
C)big endian
D)birthday attack

Free

Multiple Choice

Q 30Q 30

three new versions of SHA with hash value lengths of 256, 384, and 512 bits are collectively known as __________ .
A)SHA-3
B)SHA-1
C)SHA-2
D)SHA-0

Free

Multiple Choice

Q 31Q 31

the compression function used in secure hash algorithms falls into one of two categories: a function specifically designed for the hash function or an algorithm based on a ___________ .

Free

Short Answer

Free

Short Answer

Q 33Q 33

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

Free

Short Answer

Q 34Q 34

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

Free

Short Answer

Q 35Q 35

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

Free

Short Answer

Q 36Q 36

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

Free

Short Answer

Q 37Q 37

Requirements for a cryptographic hash function include ___________ which is the one-way property.

Free

Short Answer

Q 38Q 38

A hash function that satisfies the properties of variable input size, fixed output size, efficiency, preimage resistant, second preimage resistant and __________ is referred to as a strong hash function.

Free

Short Answer

Free

Short Answer

Q 40Q 40

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

Free

Short Answer

Q 41Q 41

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.

Free

Short Answer

Q 42Q 42

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

Free

Short Answer

Q 43Q 43

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

Free

Short Answer

Free

Short Answer

Q 45Q 45

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

Free

Short Answer