As of May 31, 2023, we have updated our Code of Conduct.

New answers tagged

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 ...
Richard Thiessen's user avatar
4 votes

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 ...
poncho's user avatar
  • 140k

Top 50 recent answers are included