Simultaneous reduction of a lattice basis and its reciprocal basis

DOI10.1007/BF01202355zbMath0801.11029OpenAlexW2070628910MaRDI QIDQ1311020

Martin Seysen

Publication date: 13 January 1994

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01202355

zbMATH Keywords

lattice basis reductionreciprocal latticecomputation of shortest vectors

Mathematics Subject Classification ID

Quadratic forms (reduction theory, extreme forms, etc.) (11H55)

Related Items

Towards faster polynomial-time lattice reduction, Lattice basis reduction: Improved practical algorithms and solving subset sum problems, Improved low-density subset sum algorithms, Non-standard approaches to integer programming, Some inequalities related to the Seysen measure of a lattice, Symplectic Lattice Reduction and NTRU, Parallel Cholesky-based reduction for the weighted integer least squares problem, Constructing Rational Representations of Finite Groups, Discrete analogues of John's theorem, Fast reduction of algebraic lattices over cyclotomic fields

Cites Work

• Unnamed Item
• Unnamed Item
• Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice
• A hierarchy of polynomial time lattice basis reduction algorithms
• Simultaneously good bases of a lattice and its reciprocal lattice
• Factoring polynomials with rational coefficients
• Polynomial Time Algorithms for Finding Integer Relations among Real Numbers
• Integer Programming with a Fixed Number of Variables
• Solving low-density subset sum problems
• An Improved Low-Density Subset Sum Algorithm
• Factoring Integers and Computing Discrete Logarithms via Diophantine Approximation
• How to Calculate Shortest Vectors in a Lattice
• A more efficient algorithm for lattice basis reduction