Paper 2021/265
On the Hardness of Module-LWE with Binary Secret
Katharina Boudgoust, Corentin Jeudy, Adeline Roux-Langlois, and Weiqiang Wen
Abstract
We prove that the Module Learning With Errors (M-LWE) problem with binary secrets and rank
Metadata
- Available format(s)
-
PDF
- Category
- Foundations
- Publication info
- Published elsewhere. Minor revision. CT-RSA 2021
- Keywords
- Lattice-based cryptographymodule learning with errorsbinary secret
- Contact author(s)
- katharina boudgoust @ irisa fr
- History
- 2021-03-03: received
- Short URL
- https://ia.cr/2021/265
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2021/265, author = {Katharina Boudgoust and Corentin Jeudy and Adeline Roux-Langlois and Weiqiang Wen}, title = {On the Hardness of Module-{LWE} with Binary Secret}, howpublished = {Cryptology {ePrint} Archive, Paper 2021/265}, year = {2021}, url = {https://eprint.iacr.org/2021/265} }