Abstract
In order to implement the original BKZ algorithm in parallel, we describe it in terms of parallelism and give its parallel implementation scheme. Then we analyze the efficiency of algorithm’s parallel implementation and show that the speedup factor of BKZ algorithm in parallel is extremely low. Therefore we present a new parallel lattice reduction algorithm suitable for multiprocessor computer architecture. The new algorithm can obtain a BKZ reduced basis and the parallel speedup is effective. Also with the practical results, although the computational complexity increases compared with the original BKZ algorithm, we still indicate that the new algorithm performs well in parallel and the time cost in parallel is less. At the same time, we show that the length of the shortest vector is smaller.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Grotschel M, Lovasz L, Schrijver A. Geometric Algorithm and Combinatorial Optimization. Berlin: Springer-Verlag, 1993
Lenstra A K, Lenstra H W, Lovasz L. Factoring polynomials with rational coefficients. Mathematiche Annalen, 1982, 261: 515–534
Coppersmith D. Finding a small root of a univariate modular equation. In: Proceedings of International Conference on the Theory and Application of Cryptographic Techniques, Saragossa, 1996. 155–165
Han L D, Wang X Y, Xu G W. On an attack on RSA with small CRT-exponents. Sci China Inf Sci, 2010, 53: 1511–1518
Santanu S. Some results on cryptanalysis of RSA and factorization. Dissertation for Ph.D. Degree. Kolkata: Indian Statistical Institute, 2011
Kumar R S, Narasimam C, Setty S P. Lattice based tools in cryptanalysis for public key cryptography. Int J Netw Secur Appl, 2012, 4: 155–162
Schnorr C P. Block reduced lattice bases and successive minima. Comb Probab Comput, 1994, 3: 507–522
Joux A. A tutorial on high performance computing applied to cryptanalysis. In: Proceedings of 31st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Cambridge, 2012. 1–7
Backes W, Wetzel S. Improving the parallel Schnorr-Euchner LLL algorithm. In: Proceedings of 11th International Conference, ICA3PP, Melbourne, 2011. 27–39
Dagdelen O, Schneider M. Parallel enumeration of shortest lattice vectors. In: Proceedings of 16th International Euro-Par Conference, Ischia, 2010. 211–222
Nguyen P Q, Valle B. The LLL Algorithm: Survey and Applications. 1st ed. Berlin: Springer, 2009. 19–71
Schnorr C P, Euchner M. Lattice basis reduction: improved practical algorithms and sovling subset sum problems. Math Program, 1994, 66: 181–199
Hanrot G, Pujol X, Stehle D. Analyzing blockwise lattice algorithms using dynamical systems. In: Proceedings of 31st Annual Cryptology Conference, Santa Barbara, 2011. 447–464
Nguyen P Q, Stehle D. LLL on the average. In: Proceedings of 7th International Symposium, ANTS-VII, Berlin, 2006. 238–256
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Liu, X., Fang, X., Wang, Z. et al. A new parallel lattice reduction algorithm for BKZ reduced bases. Sci. China Inf. Sci. 57, 1–10 (2014). https://doi.org/10.1007/s11432-013-4967-6
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11432-013-4967-6