On the geometry of cyclic lattices

DOI10.1007/s00454-014-9608-3zbMath1310.11071arXiv1406.4470OpenAlexW2129110547MaRDI QIDQ464733

Xun Sun, Lenny Fukshansky

Publication date: 29 October 2014

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1406.4470

zbMATH Keywords

shortest vector problemwell-rounded latticescyclic lattices

Mathematics Subject Classification ID

Lattices and convex bodies (number-theoretic aspects) (11H06) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Quadratic forms (reduction theory, extreme forms, etc.) (11H55)

Related Items (5)

Cyclic and well-rounded lattices ⋮ The linear transformation that relates the canonical and coefficient embeddings of ideals in cyclotomic integer rings ⋮ On Lattices Generated by Finite Abelian Groups ⋮ Permutation invariant lattices ⋮ Erratum to: ``On the geometry of cyclic lattices

Uses Software

• NTRU
• NTRUSign

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Frobenius problem and the covering radius of a lattice
• Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
• Making NTRU as Secure as Worst-Case Problems over Ideal Lattices
• Post-Quantum Cryptography
• Generalized Compact Knapsacks Are Collision Resistant
• On the computation of lattice vectors of minimal length, successive minima and reduced bases with applications
• Minkowski Reduction of Integral Matrices
• On the complexity of decoding lattices using the Korkin-Zolotarev reduced basis
• Minkowski’s conjecture, well-rounded lattices and topological dimension
• Sieving for Shortest Vectors in Ideal Lattices
• On Nearly Orthogonal Lattice Bases and Random Lattices
• Theory of Cryptography

This page was built for publication: On the geometry of cyclic lattices