Lecture notes in computer science

On the Hardness of Module-LWE with Binary Secret

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

Published Jan 1, 2021• 16 citations

Related papers

Towards Classical Hardness of Module-LWE: The Linear Rank Case

Katharina Boudgoust, Corentin Jeudy, Adeline Roux-Langlois +1 more

Hardness of Entropic Module-LWE

Hao Lin, Mingqiang Wang, Jincheng Zhuang +1 more

Entropic Hardness of Module-LWE from Module-NTRU

Katharina Boudgoust, Corentin Jeudy, Adeline Roux-Langlois +1 more

Hardness of Module-LWE and Ring-LWE on General Entropic Distributions.

Hao Lin, Yang Wang, Mingqiang Wang

An Identity-Based Fully Homomorphic Encryption from Module-LWE

Shan Ma, YiChen Li, Chunyu Qiu

On the Hardness of Learning With Errors with Binary Secrets.

Daniele Micciancio