[Cryptography] hash size

Kristian Gjøsteen kristian.gjosteen at ntnu.no
Thu Nov 1 15:18:43 EDT 2018

31. okt. 2018 kl. 23:03 skrev jamesd at echeque.com:
> Launching a birthday attack on a 128 bit hash would involve generating 2^64 hashes and sorting them.

Does it? Pollard’s lambda certainly does not. I believe it can be made parallel with the usual techniques. That is, you can find collisions with little communication and insignificant storage.

Kristian Gjøsteen

More information about the cryptography mailing list