Browse > Article
http://dx.doi.org/10.13089/JKIISC.2005.15.2.95

Guess-then-Reduce Methods for Convolution Modular Lattices  

Han Daewan (National Security Research Institute)
Hong Jin (National Security Research Institute)
Yeom Yongjin (National Security Research Institute)
Publication Information
Journal of the Korea Institute of Information Security & Cryptology / v.15, no.2, 2005 , pp. 95-103 More about this Journal
Abstract
Convolution modular lattices appeared in the analysis of NTRU public key cryptosystem. We present three guess-then-reduce methods on convolution modular lattices, and apply them to practical parameters of NTRU. For the present our methods don't affect significantly the security of them. However, Hey have room for improvement and can be used to estimate mole closely the security of systems related to convolution modular lattices.
Keywords
Convolution modular lattice; NTRU cryptosystem; Lattice attack;
Citations & Related Records
연도 인용수 순위
  • Reference
1 D. Micciancio, Generalized Compact Knapsacks, Cyclic Lattices, and Efficient One-way Functions from Worstcase Complexity Assumptions, In Proceedings of the 43th annual symposium on foundations of computer science-FOCS 2002, pp. 356-365, 2002
2 C. Gentry, Key Recovery and Message Attacks on NTRU-Composite, Eurocrypt 2001, LNCS 2045, SpringerVerlag, 2001
3 J. H. Silverman, Dimension-Reduced Lattices, Zero-Forced Lattices, and the NTRU Public Key Cryptosystem, Technical Report #13, NTRU Cryptosystems
4 P. Q. Nguyen, J. Stern, The Two Faces of Lattices in Cryptology, CaLC 2001, LNCS 2146, Springer-Verlag, 2001
5 IEEE Standard P1363.1/D4, Standard Specifications for Public Key Cryptography : Techniques Based on Hard Problems over Lattices, IEEE
6 J. Buchmann, C. Ludwig, Practical Lattice Basis Sampling Reduction, IACR ePrint 2005/072, 2005
7 NTL - A Number Theory Library, Victor Shoup, http://shoup.net/ntl
8 J. Hoffstein and J. H. Silverman, Optimizations for NTRU, Public-Key Cryptogrphy and Computational Number Theory, DeGruyter, 2002
9 H. Cohen, A Course in Computational Algebraic Number Theory, Springer Verlag, 1993
10 J. Hoffstein, J. Pipher, J. H. Silverman, NTRU: A Ring-Based Public Key Cryptosystem, ANTS III, LNCS 1423, Springer-Verlag, 1998
11 S. Paeng, B. Jung, and K. Ha, A Lattice Based Public Key Cryptosystem Using Polynomial Representaions, PKC 2003, LNCS 2567, pp. 292-308, Springer-Verlag, 2003   DOI   ScienceOn
12 D. Coppersmith and A. Shamir, Lattice Attacks on NTRU, Eurocrypt '97, LNCS 1233, Springer-Verlag, 1997
13 C. P. Schnorr, A Hierarchy of Polynomial Time Lattice Basis Reduction Algorithms, Theoretical Computer Science 53, 201-224, 1987   DOI   ScienceOn
14 A. May and J. H. Silverman, Dimension Reduction Methods for Convolution Modular Lattices, CaLC 2001, LNCS 2146, Springer-Verlag, 2001
15 N. Howgrave-Graham, J. H. Silverman, W. Whyte, A Meet-In-The-Mi ddle Attack on an NTRU Private Key, Technical Report #4, NTRU Cryptosystems
16 J. Hoffstein, J. H. Silverman, and W. Whyte, Estimated Breaking Times for NTRU Lattices, Technical Report #12( Version 2), NTRU Cryptosystems