[Resource Topic] 1996/009: Collision-Free Hashing from Lattice Problems

Welcome to the resource topic for 1996/009

Collision-Free Hashing from Lattice Problems

Authors: Oded Goldreich, Shafi Goldwasser, Shai Halevi


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.

ePrint: https://eprint.iacr.org/1996/009

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .