scientific article; zbMATH DE number 3870586
[For the entire collection see Zbl 0532.00010.] The paper presents a refined analysis of the short vector construction in integral lattices by \textit{A. K. Lenstra, H. W. Lenstra jun.} and \textit{L. Lovász} [Math. Ann. 261, 515-534 (1982; Zbl 0488.12001)]. This analysis improves the exponent of the asymptotical running-time by one, in case classical integer arithmetic is used. Another improvement is achieved by performing the vector operations modulo a sufficiently large integer. The latter is strongly suggested for implementations of the algorithm. Work on improving the algorithm when it is applied to lattices arising from rational polynomial factorization is reported by \textit{A. Schönhage} [Lect. Notes Comput. Sci. 172, 436-447 (1984)] and on improving the quality of the approximation by \textit{C. P. Schnorr} (manuscript, 1984).
- scientific article; zbMATH DE number 3972987
- Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis
- A sieve algorithm for the shortest lattice vector problem
- A hierarchy of polynomial time lattice basis reduction algorithms
- scientific article; zbMATH DE number 3908520
- A heuristic irreducibility test for univariate polynomials
- Factorization properties of lattices over the integers
- Shortest vector from lattice sieving: a few dimensions for free
- Shortest Integer Vectors
- Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis
- scientific article; zbMATH DE number 3979162 (Why is no real title available?)
- Lower bounds of shortest vector lengths in random NTRU lattices
- Mildly Short Vectors in Cyclotomic Ideal Lattices in Quantum Polynomial Time
- scientific article; zbMATH DE number 6292594 (Why is no real title available?)
- On finite-precision representations of geometric objects
- On the unique shortest lattice vector problem
- Analytic regression of Feynman integrals from high-precision numerical sampling
- Non-standard approaches to integer programming
- Towards a modern LLL implementation
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3336683)