Abstract
This paper introduces a number of modifications that allow for significant improvements of parallel LLL reduction. Experiments show that these modifications result in an increase of the speed-up by a factor of more than 1.35 for SVP challenge type lattice bases in comparing the new algorithm with the state-of-the-art parallel LLL algorithm. © 2011 Springer-Verlag.
Cite
CITATION STYLE
APA
Backes, W., & Wetzel, S. (2011). Improving the parallel Schnorr-Euchner LLL algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7016 LNCS, pp. 27–39). https://doi.org/10.1007/978-3-642-24650-0_4
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free