Choosing parameter sets for NTRUEncrypt with NAEP and SVES-3

Lecture Notes in Computer Science

Volumn 3376, Issue , 2005, Pages 118-135

  Howgrave Graham, Nick ^a   Silverman, Joseph H ^a   Whyte, William ^a  

^a NTRU Cryptosystems   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; SECURITY OF DATA;

NAEP; SVES-3;

CRYPTOGRAPHY;

EID: 24144458510     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30574-3_10     Document Type: Conference Paper

References (28)

1. ANSI X9.62, Public Key Cryptography for the Financial Services Industry: The Elliptic Curve Digital Signature Algorithm (ECDSA), 1999.
2. M. Bellare and P. Rogaway. Optimal asymmetric encryption. In Proc. of Eurocrypt '94, volume 950 of LNCS, pages 92-111. IACR, Springer-Verlag, 1995.
3. D. Boneh, Simplified OAEP for the RSA and Rabin functions, In proceedings of Crypto '2001, Lecture Notes in Computer Science, Vol. 2139, Springer-Verlag, pp. 275-291, 2001
4. M. Brown, D. Hankerson, J. Lopez, and A. Menezes, Software Implementation of the NIST Elliptic Curves Over Prime Fields, CT-RSA 2001, D. Naccache (Ed.), LNCS 2020, 250-265, Springer-Verlag, 2001.
5. Consortium for Efficient Embedded Security, Efficient Embedded Security Standard #1 version 2, available from http://www.ceesstandards.org.
6. D. Coppersmith and A. Shamir, Lattice Attack on NTRU, Advances in Cryptology - Eurocrypt'97, Springer-Verlag
7. C. Gentry, Key recovery and message attacks on NTRU-composite, Advances in Cryptology - Eurocrypt '01, LNCS 2045. Springer-Verlag, 2001
8. D. Hankerson, J. Hernandez, A. Menezes, Software implementation of elliptic curve cryptography over binary fields, Proceedings of CHES 2000, Lecture Notes in Computer Science, 1965 (2000), 1-24
9. 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. See also http://www.ntru.com.
10. J. Hoffstein and J. H. Silverman. Optimizations for NTRU. In Public-key Cryptography and Computational Number Theory. DeGruyter, 2000. Available at [4].
11. J. Hoffstein and J. H. Silverman, Random Small Hamming Weight Products With Applications To Cryptography, Discrete Applied Mathematics, to appear, Available from http://www.ntru.com.
12. J. Hoffstein and J. H. Silverman. Invertibility in truncated polynomial rings. Technical report, NTRU Cryptosystems, October 1998. Report #009, version 1, available at http://www.ntru.com.
13. J. Hoffstein, J. H. Silverman, W. Whyte, Estimated Breaking Times for NTRU Lattices, Technical report, NTRU Cryptosystems, June 2003 Report #012, version 2, available at http://www.ntru.com.
14. N. A. Howgrave-Graham, P. Nguyen, D. Pointcheval, J. Proos, J. H. Silverman, A. Singer, W. Whyte, The Impact of Decryption Failures on the Security of NTRU Encryption, Advances in Cryptology - Crypto 2003, Lecture Notes in Compputer Science 2729, Springer-Verlag, 2003, 226-246.
15. N. Howgrave-Graham, J. H. Silverman, A. Singer and W. Whyte. NAEP: Provable Security in the Presence of Decryption Failures IACR ePrint Archive, Report 2003172, http://eprint.iacr.org/2003/172/
16. N. A. Howgrave-Graham, J. H. Silverman, W. Whyte, A Meet-in-the-Middle Attack on an NTRU Private key, Technical report, NTRU Cryptosystems, June 2003. Report #004, version 2, available at http://www.ntru.com.
17. B. Kaliski, Comments on SP 800-57, Recommendation for Key Management, Part 1: General Guidelines. Available from http://csrc.nist.gov/CryptoToolkit/kms/CommentsSP800-57Part1.pdf.
18. N. Koblitz. Elliptic curve Cryptosystems. Mathematics of Computation, 48, pages 203-209, 1987.
19. A. K. Lenstra, E. R. Verheul, Selecting cryptographic key sizes, Journal of Cryptology vol. 14, no. 4, 2001, 255-293. Available from http://www.cryptosawy.com.
20. 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
21. T. Meskanen and A. Renvall. Wrap Error Attack Against NTRUEncrypt. Proc. of WCC '03.
22. V. Miller. Uses of elliptic curves in cryptography. In Advances in Cryptology: Crypto '85, pages 417-426, 1985.
23. NIST, Digital Signature Standard, FIPS Publication 186-2, February 2000.
24. NIST Special Publication 800-57, Recommendation for Key Management, Part 1: General Guideline, January 2003. Available from http://csrc.nist.gov/CryptoToolkit/kms/guideline-1-Jan03.pdf.
25. J. Proos Imperfect Decryption and an Attack on the NTRU Encryption Scheme, IACR ePrint Archive, report 02/2003. http://eprint.iacr.org/2003/002/.
26. R. Rivest, A. Shamir, L. M. Adleman, A method for obtaining digital signatures and public-key Cryptosystems, Communications of the ACM, 21 (1978), 120-126.
27. J. H. Silverman, Invertibility in Truncated Polynomial Rings, Technical report, NTRU Cryptosystems, October 1998 Report #009, version 1, available at http://www.ntru.com.
28. Robert D. Silverman, A Cost-Based Security Analysis of Symmetric and Asymmetric Key Lengths. RSA Labs Bulletin 13, April 2000. available from http://www.rsasecurity.com/rsalabs.