Abstract
In this paper, we introduce a new parallel variant of the LLL lattice basis reduction algorithm. Our new, multi-threaded algorithm is the first to provide an efficient, parallel implementation of the Schorr-Euchner algorithm for today’s multi-processor, multi-core computer architectures. Experiments with sparse and dense lattice bases show a speed-up factor of about 1.8 for the 2-thread and about factor 3.2 for the 4-thread version of our new parallel lattice basis reduction algorithm in comparison to the traditional non-parallel algorithm.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Backes, W., Wetzel, S.: New Results on Lattice Basis Reduction in Practice. In: Bosma, W. (ed.) ANTS 2000. LNCS, vol. 1838, pp. 135–152. Springer, Heidelberg (2000)
Backes, W., Wetzel, S.: Heuristics on Lattice Basis Reduction in Practice. ACM Journal on Experimental Algorithms 7 (2002)
Backes, W., Wetzel, S.: An Efficient LLL Gram Using Buffered Transformations. In: Ganzha, V.G., Mayr, E.W., Vorozhtsov, E.V. (eds.) CASC 2007. LNCS, vol. 4770, pp. 31–44. Springer, Heidelberg (2007)
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)
Blömer, J., May, A.: A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 251–267. Springer, Heidelberg (2005)
Butenhof, D.R.: Programming with POSIX threads. Addison-Wesley Longman Publishing Co., Inc., Boston (1997)
Cohen, H.: A Course in Computational Algebraic Number Theory. Undergraduate Texts in Mathematics. Springer, Heidelberg (1993)
Coster, M., Joux, A., LaMacchia, B., Odlyzko, A., Schnorr, C., Stern, J.: Improved Low-Density Subset Sum Algorithm. Journal of Computational Complexity 2, 111–128 (1992)
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)
Damgård, I.: A design principle for hash functions. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 416–427. Springer, Heidelberg (1990)
Filipovic, B.: Implementierung der Gitterbasenreduktion in Segmenten. Master’s thesis, University of Frankfurt am Main (2002)
Goldstein, A., Mayer, A.: On the equidistribution of Hecke points. In: Formum Mathematicum, vol. 15, pp. 165–189 (2003)
Heckler, C.: Automatische Parallelisierung und parallele Gitterbasisreduktion. PhD thesis, Universität des Saarlandes, Saarbrücken (1995)
Heckler, C., Thiele, L.: Parallel complexitiy of lattice basis reduction and a floating-point parallel algorithm. In: Reeve, M., Bode, A., Wolf, G. (eds.) PARLE 1993. LNCS, vol. 694, pp. 744–747. Springer, Heidelberg (1993)
Heckler, C., Thiele, L.: A parallel lattice basis reduction for mesh-connected processor arrays and parallel complexity. In: Proceedings of SPDP 1993, Dallas, pp. 400–407 (1993)
Joux, A.: A Fast Parallel Lattice Basis Reduction Algorithm. In: Proceedings of the Second Gauss Symposium, pp. 1–15 (1993)
Joux, A.: La Réduction des Réseaux en Cryptographie. PhD thesis, Labaratoire d’Informatique de L’Ecole Normale Superieure LIENS, Paris, France (1993)
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)
Lagarias, C., Odlyzko, A.: Solving Low-Density Subset Sum Problems. JACM 32, 229–246 (1985)
Lenstra, A., Lenstra, H., Lovász, L.: Factoring Polynomials with Rational Coefficients. Math. Ann. 261, 515–534 (1982)
Louis Roch, J.-L., Villard, G.: Parallel gcd and lattice basis reduction. In: CONPAR 1992 and VAPP 1992. LNCS, vol. 634, pp. 557–564. Springer, Heidelberg (1992)
May, A.: New RSA Vulnerabilities Using Lattice Reduction Methods. PhD thesis, University of Paderborn (2003)
May, A.: Secret Exponent Attacks on RSA-type Schemes with Moduli n=pr̂q. In: Bao, F., Deng, R., Zhou, J. (eds.) PKC 2004. LNCS, vol. 2947, pp. 218–230. Springer, Heidelberg (2004)
Micciancio, D., Goldwasser, S.: Ccomplexity of Lattice Problems—A Cryptographic Perspective. Kluwer Academic Publishers, Dordrecht (2002)
Nguyên, P.Q., Stehlé, D.: Low-dimensional lattice basis reduction revisited. In: Buell, D.A. (ed.) ANTS 2004. LNCS, vol. 3076, pp. 338–357. Springer, Heidelberg (2004)
Nguên, P.Q., Stehlé, D.: Floating-point LLL revisited. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 215–233. Springer, Heidelberg (2005)
Nguyên, P.Q., Stehlé, D.: LLL on the average. In: Hess, F., Pauli, S., Pohst, M. (eds.) ANTS 2006. LNCS, vol. 4076, pp. 238–256. Springer, Heidelberg (2006)
Nguyen, P., Stern, J.: Adapting Density Attacks to Low-Weight Knapsacks. In: Roy, B. (ed.) ASIACRYPT 2005. LNCS, vol. 3788, pp. 41–58. Springer, Heidelberg (2005)
Nguyen, P.Q.: Cryptanalysis of the Goldreich-Goldwasser-Halevi Cryptosystem from Crypto 1997. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 288–304. Springer, Heidelberg (1999)
Nguyen, P.Q., Stern, J.: Lattice Reduction in Cryptology: An Update. In: Bosma, W. (ed.) ANTS 2000. LNCS, vol. 1838, pp. 85–112. Springer, Heidelberg (2000)
Pohst, M.E., Zassenhaus, H.: Algorithmic Algebraic Number Theory. Cambridge University Press, Cambridge (1989)
Regev, O.: Lattice-based cryptography. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 131–141. Springer, Heidelberg (2006)
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)
Stevens, R.W., Rago, S.A.: Advanced Programming in the UNIX(R) Environment, 2nd edn. Addison-Wesley Professional, Reading (2005)
Villard, G.: Parallel lattice basis reduction. In: ISSAC 1992: Papers from the international symposium on Symbolic and algebraic computation, pp. 269–277. ACM, New York (1992)
Wetzel, S.: An Efficient Parallel Block-Reduction Algorithm. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol. 1423, pp. 323–337. Springer, Heidelberg (1998)
Wetzel, S.: Lattice Basis Reduction Algorithms and their Applications. PhD thesis, Universität des Saarlandes (1998)
Wiese, K.: Parallelisierung von LLL-Algorithmen zur Gitterbasisreduktion. Implementierung auf dem Intel iPSC/860 Hypercube. Master’s thesis, Universität des Saarlandes (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Backes, W., Wetzel, S. (2009). Parallel Lattice Basis Reduction Using a Multi-threaded Schnorr-Euchner LLL Algorithm. In: Sips, H., Epema, D., Lin, HX. (eds) Euro-Par 2009 Parallel Processing. Euro-Par 2009. Lecture Notes in Computer Science, vol 5704. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03869-3_88
Download citation
DOI: https://doi.org/10.1007/978-3-642-03869-3_88
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03868-6
Online ISBN: 978-3-642-03869-3
eBook Packages: Computer ScienceComputer Science (R0)