Advertisement

Dimension Reduction Methods for Convolution Modular Lattices

  • Alexander May
  • Joseph H. Silverman
Conference paper
  • 1.3k Downloads
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2146)

Abstract

We describe a dimension reduction method for convolution modular lattices. Its effectiveness and implications for parallel and distributed computing are analyzed.

Keywords

Lattice reduction cryptography convolution modular lattice 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    M. Ajtai, The shortest vector problem in l 2 is NP-hard for randomized reductions, Proc. 30th ACM Symposium on the Theory of Computing, pages 10–19, 1998Google Scholar
  2. 2.
    M. Ajtai, R. Kumar, D. Sivakumar, A sieve algorithm for the shortest lattice vector problem, Proc. 33rd ACM Symposium on Theory of Computing, 2001 (to appear)Google Scholar
  3. 3.
    J.W.S. Cassels, An Introduction to the Geometry of Numbers, Die Grundlehren Der Mathematischen Wissenschaften, Springer-Verlag, 1959.Google Scholar
  4. 4.
    O. Goldreich, S. Goldwasser, S. Halevi, Public-key cryptography from lattice reduction problems, CRYPTO’97, Lect. Notes in Computer Science 1294, Springer-Verlag, 1997, 112–131.Google Scholar
  5. 5.
    O. Goldreich, D. Micciancio, S. Safra and J.P. Seifert, Approximating shortest lattice vectors is not harder than approximating closest vectors, Information Processing Letters, vol. 71, pp. 55–61, 1999.zbMATHMathSciNetCrossRefGoogle Scholar
  6. 6.
    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.CrossRefGoogle Scholar
  7. 7.
    J. Hoffstein, J. Pipher, J.H. Silverman, NSS: An NTRU Lattice-Based Signature Scheme, Advances in Cryptology—Eurocrypt 2001, Lecture Notes in Computer Science, Springer-Verlag, 2001.Google Scholar
  8. 8.
    J. Hoffstein, J. Pipher, J.H. Silverman, The NTRU Signature Scheme: Theory and Practice, preprint, June 2001.Google Scholar
  9. 9.
    IEEE P1363.1, Standard Specification for Public-Key Cryptographic Techniques Based on Hard Problems over Lattices, Draft 2, 2001.Google Scholar
  10. 10.
    Number Theory Library, Victor Shoup, http://www.cs.wisc.edu/~shoup/ntl
  11. 11.
    H. Koy, C.-P. Schnorr, Segment LLL-Reduction of Lattice Bases, Cryptography and Lattice Conference (CaLC 2001), Lecture Notes in Computer Science, Springer-Verlag, this volume.Google Scholar
  12. 12.
    H. Koy, C.-P. Schnorr, Segment LLL-Reduction with Floating Point Orthogonalization, Cryptography and Lattice Conference (CaLC 2001), Lecture Notes in Computer Science, Springer-Verlag, this volume.Google Scholar
  13. 13.
    A.K. Lenstra, H.W. Lenstra Jr., L. Lovász, Factoring polynomials with rational coefficients, Mathematische Ann. 261 (1982), 513–534.Google Scholar
  14. 14.
    A. May, Auf Polynomgleichungen basierende Public-Key-Kryptosysteme, Johann Wolfgange Goethe-Universitat, Frankfurt am Main, Fachbereich Informatik. (Masters Thesis in Computer Science, 4 June, 1999; Thesis advisor C.P. Schnorr).Google Scholar
  15. 15.
    A. May, Cryptanalysis of NTRU-107, preprint, April 1999 (unpublished).Google Scholar
  16. 16.
    D. Micciancio, The Shortest Vector in a Lattice is Hard to Approximate within Some Constant, Proc. 39th IEEE Symposium on Foundations of Computer Science, pages 92–98, 1998Google Scholar
  17. 17.
    P. Nguyen, Cryptanalysis of the Goldreich-Goldwasser-Halevi Cryptosystem, Advances in Cryptology-Proceedings of CRYPTO’ 99, M. Wiener (ed.), Lecture Notes in Computer Science, Springer-Verlag, 1999.Google Scholar
  18. 18.
    C.P. Schnorr, M. Euchner, Lattice basis reduction: improved practical algorithms and solving subset sum problems, Math. Programming 66 (1994), no. 2, Ser. A, 181–199.MathSciNetCrossRefGoogle Scholar
  19. 19.
    C.P. Schnorr, A hierarchy of polynomial time lattice basis reduction algorithms, Theoretical Computer Science 53, pages 201–224, 1987zbMATHMathSciNetCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Alexander May
    • 1
  • Joseph H. Silverman
    • 2
    • 3
  1. 1.Department of Mathematics and Computer ScienceUniversity of PaderbornPaderbornGermany
  2. 2.NTRU Cryptosystems, Inc.BurlingtonUSA
  3. 3.Mathematics DepartmentBrown UniversityProvidenceUSA

Personalised recommendations