scientific article
From MaRDI portal
Publication:3549647
zbMath1232.68069MaRDI QIDQ3549647
Publication date: 5 January 2009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
ideal latticesconnection factors\(n\)-dimensional latticesapproximate shortest vectorslattices with algebraic structure
Lattices and convex bodies (number-theoretic aspects) (11H06) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
On the ring-LWE and polynomial-LWE problems ⋮ Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs ⋮ Asymptotically efficient lattice-based digital signatures ⋮ Bonsai trees, or how to delegate a lattice basis ⋮ Digital Signatures Based on the Hardness of Ideal Lattice Problems in All Rings ⋮ The linear transformation that relates the canonical and coefficient embeddings of ideals in cyclotomic integer rings ⋮ Fiat-Shamir signatures based on module-NTRU ⋮ Towards classical hardness of module-LWE: the linear rank case ⋮ Arithmetically equivalent number fields have approximately the same successive minima ⋮ Short Bases of Lattices over Number Fields ⋮ Asymptotically Efficient Lattice-Based Digital Signatures ⋮ Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding ⋮ The Geometry of Lattice Cryptography ⋮ Worst-case to average-case reductions for module lattices
