Hashes Flashcards
1
Q
if the length of a hash is 128 bits, then how many messages does an attack need to search in order to find two that share the same hash?
A
2^64 (the square root of 2 to the 128th)P2 L8
2
Q
The one-way has function is important not only in message authentication, but also in digital signatures
A
false(in digital signatures, the input plain-text is sent anyway)P2 L8
3
Q
SHA processes the input one block at a time, but each block goes through the same processing
A
trueP2 L8
4
Q
HMAC is secure provided that the embedded hash function has good cryptographic strengths such as one-way and collision-resistance
A
trueP2 L8