Cyclic lattices, ideal lattices, and bounds for the smoothing parameter

DOI10.1007/978-981-99-2366-3_7MaRDI QIDQ6608567FDOQ6608567

Authors: Liu Fengxia, Lu Yunfan, Tian Kun 

Publication date: 20 September 2024

zbMATH Keywords

smoothing parameterideal latticefinitely generated \(R\)-modulecyclic lattice

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Lattice-based Cryptography
• Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
• New bounds in some transference theorems in the geometry of numbers
• Generalized Compact Knapsacks Are Collision Resistant
• Title not available (Why is that?)
• The inapproximability of lattice and coding problems with preprocessing
• Improved Inapproximability of Lattice and Coding Problems With Preprocessing
• The hardness of the closest vector problem with preprocessing
• The spectral norms of geometric circulant matrices with the generalized \(k\)-Horadam numbers

This page was built for publication: Cyclic lattices, ideal lattices, and bounds for the smoothing parameter

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6608567)