Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures

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

Volumn 4004 LNCS, Issue , 2006, Pages 271-288

  Nguyen, Phong Q ^a   Regev, Oded ^b  

^a ECOLE NORMALE SUPÉRIEURE   (France)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CRIME; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; HEURISTIC METHODS; LEARNING SYSTEMS; SECURITY OF DATA;

CRYPTANALYSIS; GOLDREICH-GOLDWASSER-HALEVI (GGH) DESIGN; NTRU SIGNATURES;

CRYPTOGRAPHY;

EID: 33746038898     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11761679_17     Document Type: Conference Paper

References (27)

1. M. Ajtai. Generating hard instances of lattice problems. In Proc. of 28th STOC, pages 99-108. ACM, 1996.
2. N. Alon and J. H. Spencer. The probabilistic method. Wiley-Interscience [John Wiley & Sons], New York, second edition, 2000.
3. L. Babai. On Lovász lattice reduction and the nearest lattice point problem. Combinatorica, 6:1-13, 1986.
4. Consortium for Efficient Embedded Security. Efficient embedded security standards #1: Implementation aspects of NTRUEncrypt and NTRUSign. Version 2.0 available available at [18], June 2003.
5. A. Frieze, M. Jerrum, and R. Kannan. Learning linear transformations. In 37th Annual Symposium on Foundations of Computer Science (Burlington, VT, 1996), pages 359-368. IEEE Comput. Soc. Press, Los Alamitos, CA, 1996.
6. C. Gentry, J. Jonsson, J. Stern, and M. Szydlo. Cryptanalysis of the NTRU signature scheme (NSS) from Eurocrypt 2001. In Proc. of Asiacrypt '01, volume 2248 of LNCS. Springer-Verlag, 2001.
7. C. Gentry and M. Szydlo. Cryptanalysis of the revised NTRU signature scheme. In Proc. of Evrocrypt '02, volume 2332 of LNCS. Springer-Verlag, 2002.
8. O. Goldreich, S. Goldwasser, and S. Halevi. Challenges for the GGH cryptosystem. Available at http://theory.lcs.mit.edu/~shaih/challenge.html.
9. 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. IACR, Springer-Verlag, 1997.
10. Full version vailable at ECCC as TR96-056.
11. G. Golub and C. van Loan. Matrix Computations. Johns Hopkins Univ. Press, 1996.
12. J. Hoffstein, N. A. Howgrave Graham, J. Pipher, J. H. Silverman, and W. Whyte. NTRUSIGN: Digital signatures using the NTRU lattice. Full version of [12]. Draft of April 2, 2002, available on NTRU's website.
13. J. Hoffstein, N. A. Howgrave Graham, J. Pipher, J. H. Silverman, and W. Whyte. NTRUSIGN: Digital signatures using the NTRU lattice. In Proc. of CT-RSA, volume 2612 of LNCS, pages 122-140. Springer-Verlag, 2003.
14. J. Hoffstein, N. A. Howgrave Graham, J. Pipher, J. H. Silverman, and W. Whyte. Performances improvements and a baseline parameter generation algorithm for NTRUsign. In Proc. of Workshop on Mathematical Problems and Techniques in Cryptology, pages 99-126. CRM, 2005.
15. J. Hoffstein, J. Pipher, and J. H. Silverman. NSS: An NTRU lattice-based signature scheme. In Proc. of Eurocrypt '01, volume 2045 of LNCS. Springer-Verlag, 2001.
16. J. Hoffstein, J. Pipher, and J.H. Silverman. NTRU: a ring based public key cryptosystem. In Proc. of ANTS III, volume 1423 of LNCS, pages 267-288. Springer-Verlag, 1998.
17. First presented at the rump session of Crypto '96.
18. A. Hyvärinen, J. Karhunen, and E. Oja. Independent Component Analysis. John Wiley & Sons, 2001.
19. A. Hyvärinen and E. Oja. A fast fixed-point algorithm for independent component analysis. Neural Computation, 9(7):1483-1492, 1997.
20. IEEE P1363.1. Public-key cryptographic techniques based on hard problems over lattices. http://grouper.ieee.org/groups/1363/lattPK/, June 2003.
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. Improving lattice-based cryptosystems using the Hermite normal form. In Proc. of CALC '01, volume 2146 of LNCS. Springer-Verlag, 2001.
23. D. Micciancio and S. Goldwasser. Complexity of Lattice Problems: A Cryptographic Perspective, volume 671 of The Kluwer International Series in Engineering and Computer Science. Kluwer Academic Publishers, Boston, Massachusetts, 2002.
24. P. Q. Nguyen. Cryptanalysis of the Goldreich-Goldwasser-Halevi cryptosystem from Crypto '97. In Proc. of Crypto '99, volume 1666 of LNCS, pages 288-304. IACR, Springer-Verlag, 1999.
25. P. Q. Nguyen and J. Stern. The two faces of lattices in cryptology. In Proc. of CALC '01, volume 2146 of LNCS. Springer-Verlag, 2001.
26. V. Shoup. NTL: A library for doing number theory. Available at http://www.shoup.net/ntl/.
27. M. Szydlo. Hypercubic lattice reduction and analysis of GGH and NTRU signatures. In Proc. of Eurocrypt '03, volume 2656 of LNCS. Springer-Verlag, 2003.