NTRUSign: Digital signatures using the NTRU lattice

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

Volumn 2612, Issue , 2003, Pages 122-140

  Hoffstein, Jeffrey ^a   Howgrave Graham, Nick ^a   Pipher, Jill ^a   Silverman, Joseph H ^a   Whyte, William ^a  

^a NTRU Cryptosystems   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

CLOSEST VECTOR PROBLEM; NTRUSIGN; RANDOM ORACLE MODEL; SIGNATURE SCHEME;

AUTHENTICATION;

EID: 33646262791     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36563-x_9     Document Type: Article

References (20)

1. M. Ajtai, C. Dwork, A public-key cryptosystem with worst case/average case equivalence. In Proc. 29th ACM Symposium on Theory of Computing, 1997, 284-293.
2. L. Babai On Lovász lattice reduction and the nearest lattice point problem, Combinatorica, vol. 6, 1986, 1-13.
3. H. Cohen, A course in computational, algebraic number theory, GTM 138, Springer-Verlag, 1993.
4. ∼weidai/ benchmarks.html.
5. Consortium for Efficient Embedded Security, Efficient Embedded Security Standard #1, available from http://www.ceesstandards.org.
6. Craig Gentry, Jakob Jonsson, Jacques Stern, Michael Szydlo Cryptanalysis of the NTRU Signature Scheme (NSS) from Eurocrypt '01, Advances in Cryptology - Asiacrypt '01, Lecture Notes in Computer Science, Springer-Verlag, 2001.
7. C. Gentry, M Szydlo, Cryptanalysis of the Revised NTRU Signature Scheme, Advances in Cryptology - Eurocrypt '02, Lecture Notes in Computer Science, Springer-Verlag, 2002.
8. O. Goldreich, S. Goldwasser, S. Halevi, Public-key cryptography from lattice reduction problems. In Proc. CRYPTO '97, Lect. Notes in Computer Science 1294, Springer-Verlag, 1997, 112-131.
9. D. Hankerson, J. L. Hernandez, A. Menezes, Software Implementation of Elliptic Curve Cryptography over Binary Fields, Cryptographic Hardware and Embedded Systems - CHES 2000, LNCS 1965, C. K. Koc and C. Paar (eds), Springer-Verlag, 2000, 1-19.
10. J. Hoffstein, J. Pipher, J. H. Silverman, NTRU: A new high speed public key cryptosystem, in Algorithmic Number Theory (ANTS III), Portland, OR, June 1998, Lecture Notes in Computer Science 1423 (J. P. Buhler, ed.), Springer-Verlag, Berlin, 1998, 267-288.
11. J. Hoffstein, N. Howgrave-Graham, J. Pipher, J. H. Silverman, W. Whyte NTRUSign: Digital signatures using the NTRU lattice. Preliminary draft 2 http://www.ntru.com/NTRUFTPDocsFolder/NTRUSign_v2.pdf
12. J. Hoffstein, J. Pipher, J. H. Silverman, NSS: An NTRU Lattice-Based Signature Scheme, Advances in Cryptology - Eurocrypt '01, Lecture Notes in Computer Science, Springer-Verlag, 2001.
13. J. Hoffstein, D. Lieman, J. H. Silverman, Polynomial Rings and Efficient Public Key Authentication, in Proceeding of the 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.
14. J. Hoffstein, J. H. Silverman, Polynomial Rings and Efficient Public Key Authentication II, in Proceedings of a Conference on Cryptography and Number Theory (CCNT '99), (I. Shparlinski, ed.), Birkhauser.
15. A. K. Lenstra, E. R. Verheul, Selecting Cryptographic Key Sizes, Journal of Cryptology vol. 14, no. 4, 2001, 255-293.
16. T. Meskanen and A. Renvall, University of Turku, private communication.
17. A. May, J. H. Silverman, Dimension reduction methods for convolution modular lattices, in Cryptography and Lattices Conference (CaLC 2001), J. H. Silverman (ed.), Lecture Notes in Computer Science 2146, Springer-Verlag, 2001
18. P. Nguyen, Cryptanalysis of the Goldreich-Goldwasser-Halevi Cryptosystem from Crypto '97, Advances in Cryptology - Proceedings of CRYPTO '99, (August 15-19, 1999, Santa Barbara, California), M. Wiener (ed.), Lecture Notes in Computer Science, Springer-Verlag.
19. P. Nguyen and J. Stern, Lattice Reduction in Cryptology: An Update, ANTS 2000, pp 85-112.
20. A. Shamir, A polynomial-time algorithm for breaking the basic Merkel-Hellman cryptosystem. In Proceedings of the 23rd IEEE Symposium on Foundations of Computer Science, IEEE, 1982, 145-152.