Sciweavers

ACISP
2005
Springer
14 years 6 months ago
On the Possibility of Constructing Meaningful Hash Collisions for Public Keys
It is sometimes argued (as in [6]) that finding meaningful hash collisions might prove difficult. We show that at least one of the arguments involved is wrong, by showing that for...
Arjen K. Lenstra, Benne de Weger