Towards classical hardness of module-LWE: the linear rank case
From MaRDI portal
Publication:2692385
DOI10.1007/978-3-030-64834-3_10OpenAlexW3089736257MaRDI QIDQ2692385
Adeline Roux-Langlois, Corentin Jeudy, Katharina Boudgoust, Weiqiang Wen
Publication date: 21 March 2023
Full work available at URL: https://doi.org/10.1007/978-3-030-64834-3_10
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Artificial intelligence (68Txx)
Related Items
On the hardness of module-LWE with binary secret, On the hardness of module learning with errors with short distributions, Efficient laconic cryptography from learning with errors, A framework for practical anonymous credentials from lattices, Entropic hardness of Module-LWE from module-NTRU, Lattice-based timed cryptography, Hardness of (M)LWE with semi-uniform seeds, Towards classical hardness of module-LWE: the linear rank case
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Factoring polynomials with rational coefficients
- New bounds in some transference theorems in the geometry of numbers
- An upper bound for the condition number of a matrix in spectral norm
- On the ring-LWE and polynomial-LWE problems
- Adaptive estimation of a quadratic functional by model selection.
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors
- Worst-case to average-case reductions for module lattices
- Large modulus ring-LWE \(\geq \) module-LWE
- Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
- Towards classical hardness of module-LWE: the linear rank case
- Improved Security Proofs in Lattice-Based Cryptography: Using the Rényi Divergence Rather Than the Statistical Distance
- (Leveled) fully homomorphic encryption without bootstrapping
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Ring Switching in BGV-Style Homomorphic Encryption
- FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second
- Rényi Divergence and Kullback-Leibler Divergence
- Trapdoors for hard lattices and new cryptographic constructions
- On Ideal Lattices and Learning with Errors over Rings
- An Efficient and Parallel Gaussian Sampler for Lattices
- Efficient Public Key Encryption Based on Ideal Lattices
- Pseudorandomness of ring-LWE for any ring and modulus
- Public-key cryptosystems from the worst-case shortest vector problem
- On Ideal Lattices and Learning with Errors over Rings
- GGHLite: More Efficient Multilinear Maps from Ideal Lattices
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- Efficient Fully Homomorphic Encryption from (Standard) $\mathsf{LWE}$
- Classical hardness of learning with errors
- Numerical inverting of matrices of high order
- On lattices, learning with errors, random linear codes, and cryptography
- On lattices, learning with errors, random linear codes, and cryptography
