ECCC
Electronic Colloquium on Computational Complexity
Login | Register | Classic Style



REPORTS > DETAIL:

Paper:

TR96-042 | 26th July 1996 00:00

Collision-Free Hashing from Lattice Problems

RSS-Feed




TR96-042
Authors: Oded Goldreich, Shai Halevi
Publication: 29th July 1996 16:24
Downloads: 707
Keywords: 


Abstract:

Recently Ajtai described a construction of one-way functions whose
security is equivalent to the difficulty of some well known approximation
problems in lattices. We show that essentially the same
construction can also be used to obtain collision-free hashing.



ISSN 1433-8092 | Imprint