Speeding-Up Lattice Reduction with Random Projections (Extended Abstract)

DOI10.1007/978-3-540-78773-0_26zbMath1136.68622OpenAlexW2168693866MaRDI QIDQ5458537

Damien Stehlé, Ali Akhavi

Publication date: 15 April 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-78773-0_26

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Random matrices (algebraic aspects) (15B52) Randomized algorithms (68W20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Factoring polynomials with rational coefficients
• An upper bound on the average number of iterations of the LLL algorithm
• The Magma algebra system. I: The user language
• Small solutions to polynomial equations, and low exponent RSA vulnerabilities
• Random lattices, threshold phenomena and efficient reduction algorithms.
• Extensions of Lipschitz mappings into a Hilbert space
• Disproof of the Mertens conjecture.
• Searching worst cases of a one-variable function using lattice reduction
• Cryptanalysis of RSA with private key d less than N/sup 0.292/
• Progress on LLL and Lattice Reduction
• On the reduction of a random basis
• A BLAS based C library for exact linear algebra on integer matrices
• Floating-Point LLL Revisited
• Condition Numbers of Gaussian Random Matrices
• Algorithmic Number Theory

This page was built for publication: Speeding-Up Lattice Reduction with Random Projections (Extended Abstract)