Entropic hardness of Module-LWE from module-NTRU
From MaRDI portal
Publication:6169458
DOI10.1007/978-3-031-22912-1_4zbMath1519.94061MaRDI QIDQ6169458
Corentin Jeudy, Katharina Boudgoust, Adeline Roux-Langlois, Weiqiang Wen
Publication date: 14 August 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- On the hardness of module-LWE with binary secret
- Limits on the hardness of lattice problems in \(\ell_{p}\) norms
- Hardness of LWE on general entropic distributions
- Worst-case to average-case reductions for module lattices
- The Littlewood-Offord problem and invertibility of random matrices
- Towards classical hardness of module-LWE: the linear rank case
- A Decade of Lattice Cryptography
- (Leveled) fully homomorphic encryption without bootstrapping
- Improved Short Lattice Signatures in the Standard Model
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- On Ideal Lattices and Learning with Errors over Rings
- Efficient Public Key Encryption Based on Ideal Lattices
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- Classical hardness of learning with errors
- Numerical inverting of matrices of high order
- On lattices, learning with errors, random linear codes, and cryptography
- NTRU Fatigue: How Stretched is Overstretched?
- On the hardness of the NTRU problem
This page was built for publication: Entropic hardness of Module-LWE from module-NTRU