A modification of the LLL reduction algorithm
From MaRDI portal
Publication:1093661
DOI10.1016/S0747-7171(87)80061-5zbMath0629.10001MaRDI QIDQ1093661
Publication date: 1987
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
latticeLLL algorithmreduction algorithmcomputational number theorybasic vectorsmodification of the Lenstra, Lenstra, Lovasz algorithm
Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Lattices and convex bodies (number-theoretic aspects) (11H06) Software, source code, etc. for problems pertaining to number theory (11-04)
Related Items
Attacking (EC)DSA Given Only an Implicit Hint ⋮ Computing with characters of finite groups ⋮ Lattice basis reduction for indefinite forms and an application ⋮ A Practical Version of the Generalized Lagrange Algorithm ⋮ Proper reparametrization for inherently improper unirational varieties ⋮ Irreducible constituents of monomial representations. ⋮ Heeke Eigenforms in the Cohomology of Congruence Subgroups of SL(3, Z) ⋮ A generalization of the LLL-algorithm over Euclidean rings or orders ⋮ Analysis of DeepBKZ reduction for finding short lattice vectors ⋮ Short Generators Without Quantum Computers: The Case of Multiquadratics ⋮ A natural lattice basis problem with applications ⋮ LLL: A Tool for Effective Diophantine Approximation ⋮ Selected Applications of LLL in Number Theory ⋮ A Survey of Solving SVP Algorithms and Recent Strategies for Solving the SVP Challenge ⋮ Dependency of units in number fields ⋮ Constructing representations of finite groups and applications to finitely presented groups ⋮ Complexity of the Havas, Majewski, Matthews LLL Hermite normal form algorithm ⋮ Recognizing badly presented \(Z\)-modules
Cites Work
This page was built for publication: A modification of the LLL reduction algorithm
