A birthday attack

If hash function H maps into message digests of length 60 bits,

then an adversary can find a collision using only 230 inputs

Previous slide

Next slide

Back to first slide

View graphic version