scientific article; zbMATH DE number 3870586

zbMATH Open0546.68022MaRDI QIDQ3336683FDOQ3336683

Authors: Erich L. Kaltofen 

Publication date: 1983

Title of this publication is not available (Why is that?)

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

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)

Cited In (12)

• Shortest Integer Vectors
• Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis
• Non-standard approaches to integer programming
• Title not available (Why is that?)
• Title not available (Why is that?)
• Shortest vector from lattice sieving: a few dimensions for free
• 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)