Making NTRU as secure as worst-case problems over ideal lattices

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

Volumn 6632 LNCS, Issue , 2011, Pages 27-47

  Stehlé, Damien ^a   Steinfeld, Ron ^b  

^a UNIVERSITÉ DE LYON   (France)

^b MACQUARIE UNIVERSITY   (Australia)

Author keywords

Lattice based cryptography; NTRU; provable security

Indexed keywords

ASYMPTOTIC PERFORMANCE; CYCLOTOMIC FIELD; DISCRETE GAUSSIANS; ENCRYPTION SCHEMES; FACTORISATION; LATTICE PROBLEMS; LATTICE-BASED CRYPTOGRAPHY; NTRU; PROVABLE SECURITY; PROVABLY SECURE; PUBLIC KEYS; SECRET KEY; THE STANDARD MODEL;

HARDNESS; QUANTUM COMPUTERS; QUANTUM OPTICS;

QUANTUM CRYPTOGRAPHY;

EID: 79958014767     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-20465-4_4     Document Type: Conference Paper

References (35)

1. Agrawal, S., Boneh, D., Boyen, X.: Efficient lattice (H)IBE in the standard model. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 553-572. Springer, Heidelberg (2010)
2. Ajtai, M.: Generating hard instances of lattice problems (extended abstract). In: Proceedings of the 28th Symposium on the Theory of Computing (STOC 1996), pp. 99-108. ACM, New York (1996)
3. Applebaum, B., Cash, D., Peikert, C., Sahai, A.: Fast cryptographic primitives and circular-secure encryption based on hard learning problems. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 595-618. Springer, Heidelberg (2009)
4. Banks, W.D., Shparlinski, I.E.: Distribution of inverses in polynomial rings. Indagationes Mathematicae 12(3), 303-315 (2001)
5. Cash, D., Hofheinz, D., Kiltz, E., Peikert, C.: Bonsai trees, or how to delegate a lattice basis. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 523-552. Springer, Heidelberg (2010)
6. Coppersmith, D., Shamir, A.: Lattice attacks on NTRU. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 52-61. Springer, Heidelberg (1997)
7. von zur Gathen, J., Gerhardt, J.: Modern Computer Algebra, 2nd edn. Cambridge University Press, Cambridge (2003)
8. Gentry, C.: A fully homomorphic encryption scheme. PhD thesis, Stanford University (2009) (manuscript), http://crypto.stanford.edu/craig
9. Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Proc. of STOC, pp. 169-178. ACM, New York (2009)
10. Gentry, C.: Toward basing fully homomorphic encryption on worst-case hardness. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 116-137. Springer, Heidelberg (2010)
11. Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: Proc. of STOC, pp. 197-206. ACM, New York (2008)
12. Higham, N.: Accuracy and Stability of Numerical Algorithms, 2nd edn. SIAM, Philadelphia (2002)
13. Hoffstein, J., Howgrave-Graham, N., Pipher, J., Whyte, W.: Practical lattice-based cryptography: NTRUEncrypt and NTRUSign. In: Chapter of [26] (2009)
14. Hoffstein, J., Pipher, J., Silverman, J.H.: NTRU: a new high speed public key cryptosystem. Preprint; presented at the rump session of Crypto 1996 (1996)
15. Hoffstein, J., Pipher, J., Silverman, J.H.: NTRU: A ring-based public key cryptosystem. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol. 1423, pp. 267-288. Springer, Heidelberg (1998)
16. Hoffstein, J., Pipher, J., Silverman, J.H.: NSS: An NTRU lattice-based signature scheme. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, p. 211. Springer, Heidelberg (2001)
17. IEEE P1363. Standard specifications for public-key cryptography, http://grouper.ieee.org/groups/1363/
18. Lyubashevsky, V., Micciancio, D.: Generalized compact knapsacks are collision resistant. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4052, pp. 144-155. Springer, Heidelberg (2006)
19. Lyubashevsky, V., Micciancio, D., Peikert, C., Rosen, A.: SWIFFT: A modest proposal for FFT hashing. In: Nyberg, K. (ed.) FSE 2008. LNCS, vol. 5086, pp. 54-72. Springer, Heidelberg (2008)
20. Lyubashevsky, V., Peikert, C., Regev, O.: On ideal lattices and learning with errors over rings. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 1-23. Springer, Heidelberg (2010)
21. Lyubashevsky, V., Peikert, C., Regev, O.: On ideal lattices and learning with errors over rings, Draft for the extended version of [20], dated 01/02/2011
22. Micciancio, D.: Generalized compact knapsacks, cyclic lattices, and efficient oneway functions. Comput. Complexity 16(4), 365-411 (2007)
23. Micciancio, D., Regev, O.: Worst-case to average-case reductions based on gaussian measures. SIAM J. Comput. 37(1), 267-302 (2007)
24. Micciancio, D., Regev, O.: Lattice-based cryptography. In: Bernstein, D.J., Buchmann, J., Dahmen, E. (eds.) Post-Quantum Cryptography, pp. 147-191. Springer, Heidelberg (2009)
25. Micciancio, D., Voulgaris, P.: A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations. In: Proc. of STOC, pp. 351-358. ACM, New York (2010)
26. Nguyen, P.Q., Vallée, B. (eds.): The LLL Algorithm: Survey and Applications. Information Security and Cryptography. Springer, Heidelberg (2009)
27. p norms. Comput. Complexity 2(17), 300-351 (2008)
28. Peikert, C.: Public-key cryptosystems from the worst-case shortest vector problem. In: Proc. of STOC, pp. 333-342. ACM, New York (2009)
29. Peikert, C., Rosen, A.: Efficient collision-resistant hashing from worst-case assumptions on cyclic lattices. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 145-166. Springer, Heidelberg (2006)
30. Perlner, R.A., Cooper, D.A.: Quantum resistant public key cryptography: a survey. In: Proc. of IDtrust, pp. 85-93. ACM, New York (2009)
31. Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. J. ACM 56(6) (2009)
32. Regev, O.: The learning with errors problem. Invited survey in CCC 2010 (2010), http://www.cs.tau.ac.il/~odedr/
33. Schnorr, C.P.: A hierarchy of polynomial lattice basis reduction algorithms. Theor. Comput. Science 53, 201-224 (1987)
34. Stehlé, D., Steinfeld, R., Tanaka, K., Xagawa, K.: Efficient public key encryption based on ideal lattices. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol. 5912, pp. 617-635. Springer, Heidelberg (2009)
35. Xylouris, T.: On Linnik's constant (2009) (in German), http://arxiv.org/abs/0906.2749