Cryptanalysis of the goldreich—goldwasser—halevi cryptosystem from crypto'97

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1666, Issue , 1999, Pages 288-304

  Nguyen, Phong ^a  

^a ECOLE NORMALE SUPÉRIEURE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

SECURITY OF DATA;

CIPHERTEXTS; CLOSEST VECTOR PROBLEM; CRYPTOGRAPHIC PROTOCOLS; LATTICE PROBLEMS; NUMERICAL CHALLENGES; PLAINTEXT; PUBLIC KEY CRYPTOSYSTEMS;

PUBLIC KEY CRYPTOGRAPHY;

EID: 84957089305     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48405-1_18     Document Type: Conference Paper

References (28)

1. M. Ajtai. Generating hard instances of lattice problems. In Proc. 28th ACM STOC, pages 99-108 1996 Available at [10] as TR96-007.
2. M. Ajtai. The shortest vector problem in L2 is NP-hard for randomized reductions. In Proc. 30th ACM STOC, 1998. Available at [10] as TR97-047.
3. M. Ajtai and C. Dwork. A public-key cryptosystem with worst-case/average-case equivalence. In Proc. 29th ACM STOC, pages 284-293 1997 Available at [10] as TR96-065.
4. L. Babai. On Lovász lattice reduction and the nearest lattice point problem. Combinatorica, 6:13, 1986.
5. M. Bellare and D. Micciancio. A new paradigm for collision-free hashing: Incrementality at reduced cost. In Proc. of Eurocrypt '97, volume 1233 of LNCS. Springer-Verlag, 1997.
6. J. Blömer and J.-P. Seifert. On the complexity of computing short linearly independent vectors and short bases in a lattice. In Proc. 31th ACM STOC, 1999. To appear.
7. J.-Y. Cai and A. P. Nerurkar. An improved worst-case to average-case connection for lattice problems. In Proc. 38th IEEE FOCS pages 468-477 1997.
8. H. Cohen. A course in computational algebraic number theory. Springer, 1995. 2nd Edition
9. I. Dinur, G. Kindler, and S. Safra. Approximating-CVP to within almostpolynomial factors is NP-hard. In Proc. 39th IEEE FOCS, pages 99-109 1998. Available at [10] as TR98-048
10. ECCC. http://www.eccc.uni-trier.de/eccc/. The Electronic Colloquium on Computational Complexity.
11. P. van Emde Boas. Another NP-complete problem and the complexity of computing short vectors in a lattice. Technical report, Mathematische Instituut, University of Amsterdam, 1981. Report 81-04.
12. O. Goldreich. Private communication, Jan. 99.
13. O. Goldreich and S. Goldwasser. On the limits of non-approximability of lattice problems. In Proc. 30th ACM STOC, 1998. Available at [10] as TR97-031.
14. O. Goldreich, S. Goldwasser, and S. Halevi. Challenges for the GGH-Cryptosystem. Available at http://theory.lcs.mit.edu/~shaih/challenge.html.
15. O. Goldreich, S. Goldwasser, and S. Halevi. Collision-free hashing from lattice problems. Available at [10] as TR96-056
16. O. Goldreich, S. Goldwasser, and S. Halevi. Public-key cryptosystems from lattice reduction problems. In Proc. of Crypto'97, volume 1294 of LNCS, pages 112-131 Springer-Verlag, 1997. Available at [10] as TR96-056
17. O. Goldreich, D. Micciancio, S. Safra, and J.-P. Seifert. Approximating shortest lattice vectors is not harder than approximating closest lattice vectors. Available at [10] as TR99-002
18. The LIDIA Group. LiDIA - a library for computational number theory. Can be obtained at http://www-jb.cs.uni-sb.de/LiDIA/linkhtml/lidia/lidia.html.
19. R. Impagliazzo and M. Naor. Ecient cryptographic schemes provably as secure as subset sum. Journal of Cryptology, 9(4):199-216, 1996.
20. A. K. Lenstra, H. W. Lenstra, and L. Lovász. Factoring polynomials with rational coecients. Math. Ann., 261:515-534, 1982.
21. R.J. McEliece. A public-key cryptosystem based on algebraic number theory. Technical report, Jet Propulsion Laboratory, 1978. DSN Progress Report 42-44.
22. D. Micciancio. The shortest vector problem is NP-hard to approximate within some constant. In Proc. 39th IEEE FOCS, 1998. Available at [10] as TR98-016
23. P. Nguyen and J. Stern. Cryptanalysis of the Ajtai-Dwork Cryptosystem. In Proc. of Crypto '98, volume 1462 of LNCS, pages 223-242 Springer-Verlag, 1998.
24. A. M. Odlyzko. The rise and fall of knapsack cryptosystems. In Cryptology and Computational Number Theory, volume 42 of Proceedings of Symposia in Applied Mathematics, pages 75-88 A.M.S., 1990.
25. C.-P. Schnorr. A hierarchy of polynomial lattice basis reduction algorithms. Theoretical Computer Science, 53:201-224, 1987.
26. C-P. Schnorr, M. Fischlin, H. Koy, and A. May. Lattice attacks on GGHCryptosystem. Rump session of Crypto '97
27. C.P. Schnorr and H.H. Hörner. Attacking the Chor-Rivest cryptosystem by improved lattice reduction. In Proc. of Eurocrypt'95, volume 921 of LNCS, pages 12 Springer-Verlag, 1995.
28. V. Shoup. Number Theory C++ Library (NTL) version 3.6. Can be obtained at http://www.shoup.net/ntl/.