Entropic hardness of Module-LWE from module-NTRU

DOI10.1007/978-3-031-22912-1_4MaRDI QIDQ6169458zbMATH OpenFDO

Authors Katharina Boudgoust, Corentin Jeudy, Adeline Roux-Langlois, Weiqiang Wen

Publication date 14 August 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-22912-1_4

zbMATH Keywords

entropic hardnesslattice-based cryptographymodule learning with errorsmodule-NTRU

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Hardness of LWE on general entropic distributions
• On the hardness of module-LWE with binary secret
• Lossiness and entropic hardness for ring-LWE
• Order-LWE and the hardness of ring-LWE with entropic secrets
• Towards classical hardness of module-LWE: the linear rank case
• Hardness of \(k\)-LWE and applications in traitor tracing
• Hardness of \(k\)-LWE and applications in traitor tracing
• Revisiting the hardness of binary error LWE
• Obfuscating conjunctions under entropic ring LWE
• Hardness of SIS and LWE with small parameters

Cites work

• (Leveled) fully homomorphic encryption without bootstrapping
• A decade of lattice cryptography
• Classical hardness of learning with errors
• Efficient public key encryption based on ideal lattices (extended abstract)
• Hardness of LWE on general entropic distributions
• scientific article; zbMATH DE number 1186948 (Why is no real title available?)
• Improved short lattice signatures in the standard model
• Limits on the hardness of lattice problems in \(\ell_{p}\) norms
• NTRU Fatigue: How Stretched is Overstretched?
• Numerical inverting of matrices of high order
• On ideal lattices and learning with errors over rings
• On lattices, learning with errors, random linear codes, and cryptography
• On the hardness of learning with errors with binary secrets
• On the hardness of module-LWE with binary secret
• On the hardness of the NTRU problem
• The Littlewood-Offord problem and invertibility of random matrices
• Towards classical hardness of module-LWE: the linear rank case
• Trapdoors for lattices: simpler, tighter, faster, smaller
• Worst-case to average-case reductions for module lattices
• Worst‐Case to Average‐Case Reductions Based on Gaussian Measures

Cited in

(11)

• Lossiness and entropic hardness for ring-LWE
• Hardness of LWE on general entropic distributions
• On the hardness of module learning with errors with short distributions
• Hardness of (M)LWE with semi-uniform seeds
• NTRU in Quaternion Algebras of Bounded Discriminant
• Hardness of entropic module-LWE
• On the multi-user security of LWE-based NIKE
• Module learning with errors with truncated matrices
• Revisiting the robustness of (R/M)LWR under polynomial moduli with its applications
• Hardness of M-LWE with general distributions and applications to leaky variants
• On the hardness of module-LWE with binary secret

This page was built for publication: Entropic hardness of Module-LWE from module-NTRU

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