Multiple Choice
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
Correct Answer:
Verified
Q8: It can be shown that some form
Q9: the kind of hash function needed for
Q10: the cryptographic hash function requirement that guarantees
Q11: SHA-1 is very similiar in structure and
Q12: Hash functions are commonly used to create
Q14: _ are measures of the number of
Q15: A _ is an attack based on
Q16: A _ accepts a variable length block
Q17: SHA-1 produces a hash value of _
Q18: the most widely used hash function has