Analysis and improvements of NTRU encryption paddings

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

Volumn 2442, Issue , 2002, Pages 210-225

  Nguyen, Phong Q ^a   Pointcheval, David ^a  

^a ECOLE NORMALE SUPÉRIEURE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

SECURITY OF DATA;

CHOSEN CIPHERTEXT ATTACK; ENCRYPTION SCHEMES; NTRU ENCRYPTIONS; OKAMOTO; ONE-WAY FUNCTIONS; PADDING SCHEME; PUBLIC KEY CRYPTOSYSTEMS; RANDOM ORACLE MODEL;

PUBLIC KEY CRYPTOGRAPHY;

EID: 84937406876     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45708-9_14     Document Type: Conference Paper

References (28)

1. M. Bellare, A. Desai, D. Pointcheval, and P. Rogaway. Relations among Notions of Security for Public-Key Encryption Schemes. In Proc. Of Crypto ’98, LNCS 1462, pages 26–45. Springer-Verlag, 1998
2. M. Bellare and P. Rogaway. Optimal Asymmetric Encryption. In Proc. Of Eurocrypt ’94, LNCS 950, pages 92–111. Springer-Verlag, 1995
3. D. Coppersmith and A. Shamir. Lattice Attacks on NTRU. In Proc. Of Eurocrypt ’97, LNCS 1233. Springer-Verlag, 1997
4. NTRU Cryptosystems. Technical reports available at http://www.ntru.com. 2002
5. D. Dolev, C. Dwork, and M. Naor. Non-Malleable Cryptography. SIAM Journal on Computing, 30(2):391–437, 2000
6. Consortium for Efficient Embedded Security. Efficient embedded security standards #1: Implementation aspects of NTRU and NSS. Draft Version 3.0 available at http://www.ceesstandards.org, July 2001
7. E. Fujisaki and T. Okamoto. Secure Integration of Asymmetric and Symmetric Encryption Schemes. In Proc. Of Crypto ’99, LNCS 1666, pages 537–554. Springer- Verlag, 1999
8. E. Fujisaki and T. Okamoto. How to Enhance the Security of Public-Key Encryption at Minimum Cost. IEICE Trans. Fundamentals of Electronics, Comunications and Computer Sciences, E83-A(1), 2000. Special issue on cryptography and information security.
9. E. Fujisaki, T. Okamoto, D. Pointcheval, and J. Stern. RSA–OAEP is Secure under the RSA Assumption. In Proc. Of Crypto ’01, LNCS 2139, pages 260–274. Springer-Verlag, 2001
10. C. Gentry. Key Recovery and Message Attacks on NTRU-Composite. In Proc. Of Eurocrypt ’01, LNCS 2045, pages 182–194. Springer-Verlag, 2001
11. S. Goldwasser and S. Micali. Probabilistic Encryption. Journal of Computer and System Sciences, 28:270–299, 1984
12. C. Hall, I. Goldberg, and B. Schneier. Reaction Attacks against Several Public-Key Cryptosystems. In Proc. Of ICICS ’99, LNCS, pages 2–12. Springer-Verlag, 1999
13. J. Hoffstein, J. Pipher, and J.H. Silverman. NTRU: a Ring based Public Key Cryptosystem. In Proc. Of ANTS III, LNCS 1423, pages 267–288 Springer-Verlag, 1998. First presented at the rump session of Crypto ’96
14. J. Hoffstein and J. H. Silverman. Invertibility in truncated polynomial rings. Technical report, NTRU Cryptosystems, October 1998. Report #009, version 1, available at [4].
15. J. Hoffstein and J. H. Silverman. Optimizations for NTRU. In Public-key Cryptography and Computational Number Theory. DeGruyter, 2000. To appear, available at [4].
16. J. Hoffstein and J. H. Silverman. Protecting NTRU against chosen ciphertext and reaction attacks. Technical report, NTRU Cryptosystems, June 2000. Report #016, version 1
17. J. Hoffstein and J. H. Silverman. Reaction attacks against the NTRU public key cryptosystem. Technical report, NTRU Cryptosystems, June 2000. Report #015, version 2, available at [4].
18. IEEE Standard 1363. Standard specifications for public key cryptography. IEEE. Available from http://grouper.ieee.org/groups/1363, August 2000
19. E. Jaulmes and A. Joux. A Chosen Ciphertext Attack on NTRU. In Proc. Of Crypto ’00, LNCS 1880. Springer-Verlag, 2000
20. A. K. Lenstra, H. W. Lenstra, and L. Lovàsz. Factoring Polynomials with Rational Coefficients. Mathematische Ann., 261:513–534, 1982
21. A. May and J. H. Silverman. Dimension Reduction Methods for Convolution Modular Lattices. In Proc. Of CALC ’01, LNCS 2146. Springer-Verlag, 2001
22. D. Micciancio. Improving Lattice-based Cryptosystems using the Hermite Normal Form. In Proc. Of CALC ’01, LNCS 2146. Springer-Verlag, 2001
23. M. Naor and M. Yung. Public-Key Cryptosystems Provably Secure against Chosen Ciphertext Attacks. In Proc. Of the 22nd STOC, pages 427–437. ACM Press, 1990
24. P. Q. Nguyen and J. Stern. The Two Faces of Lattices in Cryptology. In Proc. Of CALC ’01, LNCS 2146. Springer-Verlag, 2001
25. T. Okamoto and D. Pointcheval. REACT: Rapid Enhanced-security Asymmetric Cryptosystem Transform. In Proc. Of CT-RSA ’01, LNCS 2020, pages 159–175. Springer-Verlag, 2001
26. D. Pointcheval. Chosen-Ciphertext Security for any One-Way Cryptosystem. In Proc. Of PKC ’00, LNCS 1751, pages 129–146. Springer-Verlag, 2000
27. C. Rackoff and D. R. Simon. Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack. In Proc. Of Crypto ’91, LNCS 576, pages 433–444. Springer-Verlag, 1992
28. C. P. Schnorr. A Hierarchy of Polynomial Lattice Basis Reduction Algorithms. Theoretical Computer Science, 53:201–224, 1987.