NSS: An NTRU lattice-based signature scheme

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

Volumn 2045, Issue , 2001, Pages 211-228

  Hoffstein, Jeffrey ^a   Pipher, Jill ^a   Silverman, Joseph H ^a  

^a NTRU Cryptosystems Inc   (United States)

Author keywords

Digital signature; Lattice based cryptography; NSS; NTRU; Public key authentication

Indexed keywords

CRYPTOGRAPHY; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; PUBLIC KEY CRYPTOGRAPHY;

DIGITAL SIGNATURE SCHEMES; LATTICE PROBLEMS; LATTICE-BASED CRYPTOGRAPHY; NSS; NTRU; PUBLIC KEY AUTHENTICATION; PUBLIC KEY CRYPTOSYSTEMS; SIGNATURE SCHEME;

AUTHENTICATION;

EID: 38049018110     PISSN: 03029743     EISSN: 16113349     Source Type: Journal    
DOI: 10.1007/3-540-44987-6_14     Document Type: Article

References (17)

1. E.F. Brickell and K.S. McCurley. Interactive Identification and Digital Signatures, AT&T Technical Journal, November/December, 1991, 73-86.
2. L.C. Guillou and J.-J. Quisquater. A practical zero-knowledge protocol fitted to security microprocessor minimizing bothtr ansmission and memory, Advances in Cryptology—Eurocrypt ’88, Lecture Notes in Computer Science 330 (C.G. G¨unther, ed.), Springer-Verlag, 1988, 123-128.
3. 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.
4. 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.
5. J. Hoffstein, J. Pipher, J.H. Silverman, NSS: A Detailed Analysis of the NTRU Lattice-Based Signature Scheme, www.ntru.com.
6. 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.
7. 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.
8. A.J. Menezes, Software Implementation of Elliptic Curve Cryptosystems Over Binary Fields, presentation at CHES 2000, August 17, 2000.
9. A.J. Menezes and P.C. van Oorschot and S.A. Vanstone. Handbook of Applied Cryptography, CRC Press, 1996.
10. I. Mironov, A note on cryptanalysis of the preliminary version of the NTRU signature scheme, IACR preprint server, http://eprint.iacr.org/2001/005/
11. T. Okamoto. Provably secure and practical identification schemes and corresponding signature schemes, Advances in Cryptology—Crypto ’92, Lecture Notes in Computer Science 740 (E.F. Brickell, ed.) Springer-Verlag, 1993, 31-53.
12. C.-P. Schnorr. Efficient identification and signatures for smart cards, Advances in Cryptology—Crypto ’89, Lecture Notes in Computer Science 435 (G. Brassard, ed), Springer-Verlag, 1990, 239-251.
13. J.H. Silverman. Estimated Breaking Times for NTRU Lattices, NTRU Technical Note #012, March 1999, www.ntru.com.
14. J.H. Silverman. Almost Inverses and Fast NTRU Key Creation, NTRU Technical Note #014, March 1999, www.ntru.com.
15. J. Stern. A new identification scheme based on syndrome decoding, Advances in Cryptology—Crypto ’93, Lecture Notes in Computer Science 773 (D. Stinson, ed.), Springer-Verlag, 1994, 13-21.
16. J. Stern. Designing identification schemes with keys of short size, Advances in Cryptology—Crypto ’94, Lecture Notes in Computer Science 839 (Y.G. Desmedt, ed), Springer-Verlag,1994, 164-173.
17. D. Stinson, Cryptography: Theory and Practice. CRC Press, 1997.