On the hardness of module-LWE with binary secret

DOI10.1007/978-3-030-75539-3_21zbMATH Open1479.94133OpenAlexW3158568869MaRDI QIDQ826282FDOQ826282

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

Publication date: 20 December 2021

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

Recommendations

On the hardness of module learning with errors with short distributions
On the hardness of learning with errors with binary secrets
Hardness of LWE on general entropic distributions
Entropic hardness of Module-LWE from module-NTRU
Large modulus ring-LWE \(\geq \) module-LWE

zbMATH Keywords

lattice-based cryptography binary secret module learning with errors

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
On ideal lattices and learning with errors over rings
Public-key cryptosystems from the worst-case shortest vector problem
On lattices, learning with errors, random linear codes, and cryptography
Trapdoors for hard lattices and new cryptographic constructions
Efficient public key encryption based on ideal lattices (extended abstract)
Classical hardness of learning with errors
(Leveled) fully homomorphic encryption without bootstrapping
Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
On lattices, learning with errors, random linear codes, and cryptography
Trapdoors for lattices: simpler, tighter, faster, smaller
Worst-case to average-case reductions for module lattices
On ideal lattices and learning with errors over rings
Limits on the hardness of lattice problems in \(\ell_{p}\) norms
Efficient fully homomorphic encryption from (standard) LWE
An efficient and parallel Gaussian sampler for lattices
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
Large modulus ring-LWE \(\geq \) module-LWE
Towards classical hardness of module-LWE: the linear rank case
FHEW: bootstrapping homomorphic encryption in less than a second
An improved BKW algorithm for LWE with applications to cryptography and lattices
On the hardness of learning with errors with binary secrets
On the hardness of module-LWE with binary secret

Cited In (14)

On the hardness of module-LWE with binary secret
On the hardness of learning with errors with binary secrets
A trace map attack against special ring-LWE samples
Entropic hardness of Module-LWE from module-NTRU
Large modulus ring-LWE \(\geq \) module-LWE
On the complexity of the BKW algorithm on LWE
Ring/module learning with errors under linear leakage -- hardness and applications
Hardness of (M)LWE with semi-uniform seeds
On the hardness of module learning with errors with short distributions
A thorough treatment of highly-efficient NTRU instantiations
Hardness of entropic module-LWE
Hardness of Distinguishing the MSB or LSB of Secret Keys in Diffie-Hellman Schemes
Security evaluation on KpqC round 1 lattice-based algorithms using lattice estimator
BLOOM: bimodal lattice one-out-of-many proofs and applications

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

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