Next: Computational Indistinguishability - Algorithms
Up: Sabbatical at MIT (1996-1998)
Previous: The Graph Clustering Problem
This paper presents a proposal for a trapdoor one-way function
that is based on a computational problem regarding integer lattices.
Comments:
Authored by O. Goldreich, S. Goldwasser and S. Halevi.
(The security of the proposal is not rigorously related to any
known conjecture. For the suggested security parameters,
the proposal was broken a couple of years after its presentation.) Appeared in
- Proceedings of Crypto97,
Springer LNCS, Vol. 1294, pp. 112-131.
Oded Goldreich
2003-07-30