Speeding-Up Lattice Reduction with Random Projections (Extended Abstract)
From MaRDI portal
Publication:5458537
Recommendations
Cites work
- scientific article; zbMATH DE number 5547558 (Why is no real title available?)
- scientific article; zbMATH DE number 1936673 (Why is no real title available?)
- scientific article; zbMATH DE number 1559544 (Why is no real title available?)
- scientific article; zbMATH DE number 1852137 (Why is no real title available?)
- scientific article; zbMATH DE number 1852142 (Why is no real title available?)
- scientific article; zbMATH DE number 3333393 (Why is no real title available?)
- A BLAS based C library for exact linear algebra on integer matrices
- Algorithmic Number Theory
- An upper bound on the average number of iterations of the LLL algorithm
- Condition Numbers of Gaussian Random Matrices
- Cryptanalysis of RSA with private key d less than N/sup 0.292/
- Disproof of the Mertens conjecture.
- Extensions of Lipschitz mappings into a Hilbert space
- Factoring polynomials with rational coefficients
- Floating-Point LLL Revisited
- On the reduction of a random basis
- Progress on LLL and lattice reduction
- Random lattices, threshold phenomena and efficient reduction algorithms.
- Searching worst cases of a one-variable function using lattice reduction
- Small solutions to polynomial equations, and low exponent RSA vulnerabilities
- The Magma algebra system. I: The user language
Cited in
(4)- Probabilistic Analyses of Lattice Reduction Algorithms
- Fast lattice basis reduction suitable for massive parallelization and its application to the shortest vector problem
- scientific article; zbMATH DE number 1256681 (Why is no real title available?)
- An efficient lattice reduction using reuse technique blockwisely on NTRU
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)