Studied by 0 people
Looks like no one added any tags here yet for you.
What are the characteristics of a good hash algorithm
hard to find collisions, irreversible, and deterministic
What is a hash collision
A random match in hash values that occurs when a hashing algorithm produces the same hash value for 2 distinct pieces of data
MD5(3 things)
produces 16 byte digests with block sizes of 64 bytes, considered insecure due to multiple vulnerabilities. collisions can be calculated in less than a second
what does SHA1 stand for
secure hash algorithm 1
SHA1(2 things)
produces 20 byte digests using block sizes of 512 bits, prone to length extension attacks
how many rounds of hashing does SHA1 go through
80 rounds
what is SHA1 built with
merkle damgard construction
Note
Flashcard