scientific article; zbMATH DE number 3870586

MaRDI QIDQ3336683zbMATH OpenFDO

Authors Erich L. Kaltofen

Publication date 1983

zbMATH Keywords

analysis of algorithmsshort vector algorithmshort vector construction in integral lattices

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Lattices and convex bodies (number-theoretic aspects) (11H06)

Recommendations

• 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

Cited in

(12)

• Shortest Integer Vectors
• Non-standard approaches to integer programming
• 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?)
• Shortest vector from lattice sieving: a few dimensions for free
• scientific article; zbMATH DE number 6292594 (Why is no real title available?)
• On finite-precision representations of geometric objects
• A heuristic irreducibility test for univariate polynomials
• Lower bounds of shortest vector lengths in random NTRU lattices
• Mildly Short Vectors in Cyclotomic Ideal Lattices in Quantum Polynomial Time
• Factorization properties of lattices over the integers
• On the unique shortest lattice vector problem

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)