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

DOI10.1007/978-3-540-78773-0_26zbMATH Open1136.68622OpenAlexW2168693866MaRDI QIDQ5458537FDOQ5458537

Authors: Ali Akhavi, Damien Stehlé 

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

Recommendations

• Fast LLL-type lattice reduction
• Faster LLL-type Reduction of Lattice Bases
• scientific article; zbMATH DE number 1962809
• Towards faster polynomial-time lattice reduction
• Random lattices, threshold phenomena and efficient reduction algorithms.

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (4)

• An efficient lattice reduction using reuse technique blockwisely on NTRU
• Fast lattice basis reduction suitable for massive parallelization and its application to the shortest vector problem
• Probabilistic Analyses of Lattice Reduction Algorithms
• Title not available (Why is that?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458537)