On the hardness of module-LWE with binary secret

DOI10.1007/978-3-030-75539-3_21MaRDI QIDQ826282zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

lattice-based cryptography binary secret module learning with errors

Mathematics Subject Classification ID

Cryptography (94A60)

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

Cites work

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

Cited in

(14)

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