Solving low-density subset sum problems
Journal of the ACM (JACM)
Algorithmic algebraic number theory
Algorithmic algebraic number theory
A design principle for hash functions
CRYPTO '89 Proceedings on Advances in cryptology
Parallel lattice basis reduction
ISSAC '92 Papers from the international symposium on Symbolic and algebraic computation
Improved low-density subset sum algorithms
Computational Complexity
A course in computational algebraic number theory
A course in computational algebraic number theory
Programming with POSIX threads
Programming with POSIX threads
Complexity of Lattice Problems
Complexity of Lattice Problems
Parallel Complexitiy of Lattice Basis Reduction and a Floating-Point Parallel Algorithm
PARLE '93 Proceedings of the 5th International PARLE Conference on Parallel Architectures and Languages Europe
Parallel gcd and Lattice Basis Reduction
CONPAR '92/ VAPP V Proceedings of the Second Joint International Conference on Vector and Parallel Processing: Parallel Processing
Cryptanalysis of the Goldreich-Goldwasser-Halevi Cryptosystem from Crypto '97
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Lattice Basis Reduction: Improved Practical Algorithms and Solving Subset Sum Problems
FCT '91 Proceedings of the 8th International Symposium on Fundamentals of Computation Theory
An Efficient Parallel Block-Reduction Algorithm
ANTS-III Proceedings of the Third International Symposium on Algorithmic Number Theory
New Results on Lattice Basis Reduction in Practice
ANTS-IV Proceedings of the 4th International Symposium on Algorithmic Number Theory
Lattice Reduction in Cryptology: An Update
ANTS-IV Proceedings of the 4th International Symposium on Algorithmic Number Theory
Segment LLL-Reduction with Floating Point Orthogonalization
CaLC '01 Revised Papers from the International Conference on Cryptography and Lattices
Heuristics on lattice basis reduction in practice
Journal of Experimental Algorithmics (JEA)
Advanced Programming in the UNIX(R) Environment (2nd Edition)
Advanced Programming in the UNIX(R) Environment (2nd Edition)
An improved low-density subset sum algorithm
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Adapting density attacks to low-weight knapsacks
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
ANTS'06 Proceedings of the 7th international conference on Algorithmic Number Theory
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
A tool kit for finding small roots of bivariate polynomials over the integers
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
New attacks on RSA with small secret CRT-Exponents
PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
An efficient LLL gram using buffered transformations
CASC'07 Proceedings of the 10th international conference on Computer Algebra in Scientific Computing
Parallel enumeration of shortest lattice vectors
Euro-Par'10 Proceedings of the 16th international Euro-Par conference on Parallel processing: Part II
Random sampling for short lattice vectors on graphics cards
CHES'11 Proceedings of the 13th international conference on Cryptographic hardware and embedded systems
Improving the parallel schnorr-euchner lll algorithm
ICA3PP'11 Proceedings of the 11th international conference on Algorithms and architectures for parallel processing - Volume Part I
Parallel shortest lattice vector enumeration on graphics cards
AFRICACRYPT'10 Proceedings of the Third international conference on Cryptology in Africa
| Hi-index | 0.00 |
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.