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. © 2009 Springer.
CITATION STYLE
Backes, W., & Wetzel, S. (2009). Parallel lattice basis reduction using a multi-threaded Schnorr-Euchner LLL algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5704 LNCS, pp. 960–973). https://doi.org/10.1007/978-3-642-03869-3_88
Mendeley helps you to discover research relevant for your work.