Module learning with errors with truncated matrices

DOI10.1007/978-3-031-86599-2_9MaRDI QIDQ6969308zbMATH OpenFDO

Authors Katharina Boudgoust, Hannah Keller

Publication date 20 June 2025

Full work available at URL https://doi.org/10.1007/978-3-031-86599-2_9

zbMATH Keywords

latticestruncationmodule learning with errors

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94)

Cites work

• scientific article; zbMATH DE number 1186948 (Why is no real title available?)
• A systematic study of sparse LWE
• Classical hardness of learning with errors
• Efficient lattice-based inner-product functional encryption
• Entropic hardness of Module-LWE from module-NTRU
• Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
• GGHLite: more efficient multilinear maps from ideal lattices
• Generalized Compact Knapsacks Are Collision Resistant
• Hardness of LWE on general entropic distributions
• Hardness of SIS and LWE with small parameters
• Hardness of entropic module-LWE
• Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance
• Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance
• Lattice signatures without trapdoors
• Lossy codes and a new variant of the learning-with-errors problem
• Low communication threshold fully homomorphic encryption
• On lattices, learning with errors, random linear codes, and cryptography
• 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 learning with errors with short distributions
• On the ring-LWE and polynomial-LWE problems
• Public-key cryptosystems from the worst-case shortest vector problem
• Raccoon: a masking-friendly signature proven in the probing model
• Revisiting the hardness of binary error LWE
• Rényi Divergence and Kullback-Leibler Divergence
• Toward practical lattice-based proof of knowledge from Hint-MLWE
• Towards classical hardness of module-LWE: the linear rank case
• Trapdoors for hard lattices and new cryptographic constructions
• Worst-case to average-case reductions for module lattices

This page was built for publication: Module learning with errors with truncated matrices

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