Hypercubic lattice reduction and analysis of GGH and NTRU signatures

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

Volumn 2656, Issue , 2003, Pages 433-448

  Szydlo, Michael ^a  

^a RSA   (United States)

Author keywords

Decisional Lattice Problem; Distributed Lattice Reduction; GGH Cryptanalysis; Gram Matrix Factorization; Integral Lattice Embedding Orthogonal Lattice; Lattice Distinguishing Oracle; Lattice Isomorphism; NTRUSign

Indexed keywords

COMPUTATION THEORY; CRYPTOGRAPHY; CRYSTAL LATTICES; FACTORIZATION; NUMBER THEORY; POLYNOMIAL APPROXIMATION;

GGH CRYPTANALYSIS; GRAM MATRICES; INTEGRAL LATTICE EMBEDDING ORTHOGONAL LATTICE; LATTICE DISTINGUISHING ORACLE; LATTICE ISOMORPHISM; LATTICE PROBLEMS; LATTICE REDUCTION; NTRUSIGN;

MATRIX ALGEBRA;

EID: 33746070284     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-39200-9_27     Document Type: Article

References (27)

1. 2 is NP-hard for randomized reductions, in Proc. 30th ACM Symposium on Theory of Computing, 1998, 10-19.
2. H. Cohen, A Course in Computational Algebraic Number Theory, Graduate Texts in Mathematics, 138. Springer, 1993.
3. D. Coppersmith and A. Shamir, Lattice Attacks on NTRU, in Proc. of Eurocrypt '97, LNCS 1233, pages 52-61. Springer-Verlag, 1997.
4. I. Dinur, G. Kindler, S. Safra, Approximating CVP to within almost-polynomial factors is NP-hard, in Proc. 39th Symposium on Foundations of Computer Science, pages 99-109, 1998.
5. N. Elkies, Lattices, Linear Codes, and Invariants, in Notices of the American Math. Society, 47 pages 1238-1245, Cambridge University Press, 2000.
6. O. Goldreich and S. Goldwasser, On the Limits of Non-Approximability of Lattice, In Proc. of the 13th ACM Symposium on the Theory of Computing, 1998.
7. O. Goldreich, D. Micciancio, S. Safra, J.P. Seifert, Using Lattice Problem in Cryptography,1999.
8. C. Gentry, J. Jonsson, J. Stern, M. Szydlo, Cryptanalysis of the NTRU signature scheme, in Proc. of Asiacrypt '01, LNCS 2248, pages 1-20. Springer-Verlag, 2001.
9. O. Goldreich, D. Micciancio, S. Safra, J.P. Seifert, Approximating shortest lattice vectors is not harder than approximating closest lattice vectors, Electronic Colloquium on Computational Complexity, 1999.
10. C. Gentry, M. Szydlo, Cryptanalysis of the Revised NTRU signature scheme, in Proc. of Eurocrypt '02, LNCS 2332, pages 299-320. Springer-Verlag, 2002.
11. O. Goldreich, S. Goldwasser, S. Halevi, Public-key Cryptography from Lattice Reduction Problems, in Proc. of Crypto '97, LNCS 1294, pages 112-131. Springer-Verlag, 1997.
12. J. Hoffstein, N. Howgrave-Graham, J. Pipher, J.H. Silverman, W. Whyte, NTRUSign: Digital Signatures Using the NTRU Lattice, December, 2001. Available from http://www.ntru.com.
13. J. Hoffstein, B.S. Kaliski, D. Lieman, M.J.B. Robshaw, Y.L. Yin, Secure user identification based on constrained polynomials, US Patent 6,076,163, June 13, 2000.
14. J. Hoffstein, D. Lieman, J.H. Silverman, Polynomial Rings and Efficient Public Key Authentication, in Proc. International Workshop on Cryptographic Techniques and E-Commerce (CrypTEC '99), Hong Kong, (M. Blum and C.H. Lee, eds.), City University of Hong Kong Press.
15. J. Hoffstein, J. Pipher, J.H. Silverman. Enhanced encoding and verification methods for the NTRU signature scheme (ver. 2), May 30, 2001. Available from http://wvw.ntru.com.
16. J. Hoffstein, J. Pipher, J.H. Silverman, NSS: The NTRU Signature Scheme, preprint, November 2000. Available from http://www.ntru.com.
17. J. Hoffstein, J. Pipher, J.H. Silverman, NSS: The NTRU Signature Scheme, in Proc. of Eurocrypt '01, LNCS 2045, pages 211-228. Springer-Verlag, 2001.
18. J. Hoffstein, J. Pipher, J.H. Silverman, NSS: The NTRU Signature Scheme: Theory and Practice, preprint, 2001. Available from http://www.ntru.com.
19. J. Hoffstein, J. Pipher and J.H. Silverman, NTRU: A New High Speed Public Key Cryptosystem, in Proc. of Algorithm Number Theory (ANTS III), LNCS 1423, pages 267-288. Springer-Verlag, 1998.
20. A.K. Lenstra, H.W. Lenstra Jr., L. Lovász, Factoring Polynomials with Rational Coefficients, Mathematische Ann. 261 (1982), 513-534.
21. D. Micciancio, The Shortest Vector in a Lattice is Hard to Approximate to within Some Constant, in Proc. 39th Symposium on Foundations of Computer Science, 1998, 92-98.
22. P. Nguyen, Cryptanalysis of the Goldreich-Goldwasser-Halevi Cryptosystem from Crypto '97, 1999
23. P. Nguyen and J. Stern, Lattice Reduction in Cryptology: An Update, in Proc. of Algorithm Number Theory (ANTS IV), LNCS 1838, pages 85-112. Springer-Verlag, 2000.
24. C.-P. Schnorr, A Hierarchy of Polynomial Time Lattice Basis Reduction Algorithms, Theoretical Computer Science 53 (1987), 201-224.
25. J.H. Silverman, Estimated Breaking Times for NTRU Lattices, NTRU Technical Note #012, March 1999. Available from http://www.ntru.com.
26. L. Washington, Introduction to Cyclotomic Fields, Graduate Texts in Mathematics 83, 1982.
27. Consortium for Efficient Embedded Security. Efficient Embedded Security Standard (EESS) # 1: Draft 3.0. Available from http://www.ceesstandards.org.