Improving the parallel schnorr-euchner lll algorithm

Authors:
Werner Backes;Susanne Wetzel
Affiliations:
Stevens Institute of Technology, Castle Point on Hudson, Hoboken, NJ;Stevens Institute of Technology, Castle Point on Hudson, Hoboken, NJ
Venue:
ICA3PP'11 Proceedings of the 11th international conference on Algorithms and architectures for parallel processing - Volume Part I
Year:
2011

Citing 9
Cited 0

Improved low-density subset sum algorithms

Computational Complexity
Lattice Basis Reduction: Improved Practical Algorithms and Solving Subset Sum Problems

FCT '91 Proceedings of the 8th International Symposium on Fundamentals of Computation Theory
Heuristics on lattice basis reduction in practice

Journal of Experimental Algorithmics (JEA)
Public-key cryptosystems from the worst-case shortest vector problem: extended abstract

Proceedings of the forty-first annual ACM symposium on Theory of computing
Parallel Lattice Basis Reduction Using a Multi-threaded Schnorr-Euchner LLL Algorithm

Euro-Par '09 Proceedings of the 15th International Euro-Par Conference on Parallel Processing
An LLL Algorithm with Quadratic Complexity

SIAM Journal on Computing
Toward basing fully homomorphic encryption on worst-case hardness

CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Floating-Point LLL revisited

EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Lattice-based cryptography

CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology

Quantified Score

Hi-index	0.00

Visualization

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.