On the hardness of module-LWE with binary secret

DOI10.1007/978-3-030-75539-3_21zbMath1479.94133OpenAlexW3158568869MaRDI QIDQ826282

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

Publication date: 20 December 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-75539-3_21

zbMATH Keywords

lattice-based cryptography binary secret module learning with errors

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (7)

On the hardness of module-LWE with binary secret ⋮ A trace map attack against special ring-LWE samples ⋮ On the hardness of module learning with errors with short distributions ⋮ A thorough treatment of highly-efficient NTRU instantiations ⋮ BLOOM: bimodal lattice one-out-of-many proofs and applications ⋮ Entropic hardness of Module-LWE from module-NTRU ⋮ Hardness of (M)LWE with semi-uniform seeds

Cites Work

Unnamed Item
On the hardness of module-LWE with binary secret
Limits on the hardness of lattice problems in $\ell_{p}$ norms
On the ring-LWE and polynomial-LWE problems
Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs
Hardness of LWE on general entropic distributions
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
(Leveled) fully homomorphic encryption without bootstrapping
Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second
An Improved BKW Algorithm for LWE with Applications to Cryptography and Lattices
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
Public-key cryptosystems from the worst-case shortest vector problem
On Ideal Lattices and Learning with Errors over Rings
Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
Efficient Fully Homomorphic Encryption from (Standard) $\mathsf{LWE}$
Classical hardness of learning with errors
On lattices, learning with errors, random linear codes, and cryptography
On lattices, learning with errors, random linear codes, and cryptography

This page was built for publication: On the hardness of module-LWE with binary secret