New answers tagged collision-resistance
1
vote
Implementing a Merkle tree using a 128 bit hash function?
You absolutely need preimage resistance (both first preimage and second preimage) to have a functional merkle tree. Preimage resistance refers to finding hash inputs that give a given output. For an ...
4
votes
Accepted
What does the 256 in SHA3-256 and SHAKE256 refer to?
SHA3-256 this means the hash will be of 256 bits in length. Is this correct?
Yes, that is correct - exactly the same as SHA2-256 means that hash has an output of 256 bits.
But, then, what does the ...
Top 50 recent answers are included
Related Tags
collision-resistance × 702hash × 496
md5 × 65
sha-1 × 61
preimage-resistance × 60
sha-256 × 58
2nd-preimage-resistance × 37
cryptanalysis × 30
birthday-attack × 27
hmac × 24
sha-2 × 22
merkle-damgaard × 21
one-way-function × 20
aes × 18
sha-3 × 18
encryption × 14
rsa × 14
algorithm-design × 14
brute-force-attack × 14
post-quantum-cryptography × 12
mac × 12
randomness × 12
pseudo-random-function × 12
signature × 11
provable-security × 11