Skip to main content
SpringerLink
Log in

An Efficient LLL Gram Using Buffered Transformations

  • Conference paper
Computer Algebra in Scientific Computing (CASC 2007)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4770))

Included in the following conference series:

Abstract

In this paper we introduce an improved variant of the LLL algorithm. Using the Gram matrix to avoid expensive correction steps necessary in the Schnorr-Euchner algorithm and introducing the use of buffered transformations allows us to obtain a major improvement in reduction time. Unlike previous work, we are able to achieve the improvement while obtaining a strong reduction result and maintaining the stability of the reduction algorithm.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Backes, W., Wetzel, S.: Heuristics on Lattice Basis Reduction in Practice. ACM Journal on Experimental Algorithms 7 (2002)

    Google Scholar 

  2. Bleichenbacher, D., May, A.: New Attacks on RSA with Small Secret CRT-Exponents. In: Yung, M., Dodis, Y., Kiayias, A., Malkin, T.G. (eds.) PKC 2006. LNCS, vol. 3958, pp. 1–13. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  3. Cohen, H.: A Course in Computational Algebraic Number Theory. In: Undergraduate Texts in Mathematics, Springer, Heidelberg (1993)

    Google Scholar 

  4. Coster, M., LaMacchia, B., Odlyzko, A., Schnorr, C.: An Improved Low-Density Subset Sum Algorithm. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 54–67. Springer, Heidelberg (1991)

    Google Scholar 

  5. Ernst, M., Jochemsz, E., May, A., de Weger, B.: Partial Key Exposure Attacks on RSA up to Full Size Exponents. In: Cramer, R.J.F. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 371–384. Springer, Heidelberg (2005)

    Google Scholar 

  6. Filipovic, B.: Implementierung der Gitterbasenreduktion in Segmenten. Master’s thesis, University of Frankfurt am Main (2002)

    Google Scholar 

  7. Granlund, T.: GNU MP: The GNU Multiple Precision Arithmetic Library. SWOX AB, 4.2.1 edition (2006)

    Google Scholar 

  8. Klimovitski, A.: Using SSE and SSE2: Misconceptions and Reality. Intel Developer UPDATE Magazine (March 2001), http://www.intel.com/technology/magazine/computing/sw03011.pdf

  9. Koy, H., Schnorr, C.: Segment LLL-Reduction of Lattice Bases. In: Silverman, J.H. (ed.) CaLC 2001. LNCS, vol. 2146, pp. 67–80. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  10. Koy, H., Schnorr, C.: Segment LLL-Reduction with Floating Point Orthogonalization. In: Silverman, J.H. (ed.) CaLC 2001. LNCS, vol. 2146, pp. 81–96. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  11. Lenstra, A., Lenstra, H., Lovàsz, L.: Factoring Polynomials with Rational Coefficients. Math. Ann. 261, 515–534 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  12. May, A.: Cryptanalysis of NTRU, 1999 (preprint)

    Google Scholar 

  13. Nguyen, P., Stehlè, D.: Low-Dimensional Lattice Basis Reduction Revisited. In: Buell, D.A. (ed.) Algorithmic Number Theory. LNCS, vol. 3076, pp. 338–357. Springer, Heidelberg (2004)

    Google Scholar 

  14. Nguyen, P., Stehlè, D.: Floating-Point LLL Revisited. In: Cramer, R.J.F. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 215–233. Springer, Heidelberg (2005)

    Google Scholar 

  15. Nguyen, P., Stehlè, D.: LLL on the Average. In: Hess, F., Pauli, S., Pohst, M. (eds.) Algorithmic Number Theory. LNCS, vol. 4076, pp. 238–256. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  16. Nguyen, P.Q.: Cryptanalysis of the Goldreich-Goldwasser-Halevi Cryptosystem from Crypto 1997. In: Wiener, M.J. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 288–304. Springer, Heidelberg (1999)

    Google Scholar 

  17. Nguyen, P.Q., Stern, J.: Lattice Reduction in Cryptology: An Update. In: Bosma, W. (ed.) Algorithmic Number Theory. LNCS, vol. 1838, pp. 85–112. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  18. Pohst, M.E., Zassenhaus, H.: Algorithmic Algebraic Number Theory. Cambridge University Press, Cambridge (1989)

    MATH  Google Scholar 

  19. Schnorr, C., Euchner, M.: Lattice Basis Reduction: Improved Practical Algorithms and Solving Subset Sum Problems. In: Budach, L. (ed.) FCT 1991. LNCS, vol. 529, pp. 68–85. Springer, Heidelberg (1991)

    Google Scholar 

  20. Stallman, R.M., Community, G.D.: GNU Compiler Collection. Free Software Foundation, Inc. (2005)

    Google Scholar 

  21. Stehlé, D.: The New LLL Routine in the Magma Computational Algebra System. Magma 2006 Conference (2006), http://magma.maths.usyd.edu.au/Magma2006/

  22. Wetzel, S.: Lattice Basis Reduction Algorithms and their Applications. PhD thesis, Universität des Saarlandes (1998)

    Google Scholar 

  23. fpLLL - Homepage (Damien Stehlé) (July 2007), http://www.loria.fr/~stehle/

  24. GCC - Homepage (July 2007), http://gcc.gnu.org

  25. Auto-Vectorization in GCC (July 2007), http://gcc.gnu.org/projects/tree-ssa/vectorization.html

  26. GMP - Homepage, http://gmplib.org/

  27. AMD64 patch for GMP 4.2 (July 2007), http://www.loria.fr/~gaudry/mpn_AMD64/index.html

  28. Lattice Basis Reduction Experiments (July 2007), http://www.cs.stevens.edu/~wbackes/lattice/

  29. Magma - Homepage (July 2007), http://magma.maths.usyd.edu.au/

  30. NTL - Homepage (July (2007), http://www.shoup.net/ntl/

Download references

Author information

Authors and Affiliations

  1. Stevens Institute of Technology, Castle Point on Hudson, Hoboken, 07030 NJ, USA

    Werner Backes & Susanne Wetzel

Authors
  1. Werner Backes
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Susanne Wetzel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Victor G. Ganzha Ernst W. Mayr Evgenii V. Vorozhtsov

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Backes, W., Wetzel, S. (2007). An Efficient LLL Gram Using Buffered Transformations. In: Ganzha, V.G., Mayr, E.W., Vorozhtsov, E.V. (eds) Computer Algebra in Scientific Computing. CASC 2007. Lecture Notes in Computer Science, vol 4770. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75187-8_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-75187-8_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-75186-1

  • Online ISBN: 978-3-540-75187-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation