HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

Theoretical hardness of algebraically structured learning with errors

Abstract : The main focus of this Ph.D thesis lies on the computational problem Learning With Errors (LWE). It is a core building block of lattice-based cryptography, which itself is among the most promising candidates to replace current cryptographic protocols once large-scale quantum computers may be available. The contributions of the present work are separated into two different parts. First, we study the hardness of structured variants of LWE. To this end, we show that under suitable parameter choices the Module Learning With Errors (M-LWE) problem doesn’t become significantly easier to solve even if the underlying secret is replaced by a binary vector. Furthermore, we provide a classical hardness reduction for M-LWE, which further strengthens our confidence in its suitability for cryptography. Additionally, we define a new hardness assumption, the Middle-Product Computational Learning With Rounding (MP-CLWR) problem, which inherits the advantages of two existing LWE variants. Finally, we study problems related to the partial Vandermonde matrix. This is a recent source of hardness assumptions for lattice-based cryptography and its rigorous study is important to gain trust in it. In the second part of this manuscript, we show that the new hardness assumptions we introduced before serve for the construction of efficient public-key encryption. On the one hand, we design a new encryption scheme, whose security is provably based on the MP-CLWR problem. On the other hand, we modify an existing encryption scheme, called PASS Encrypt, to provide it with a security proof based on two explicitly stated partial Vandermonde problems.
Document type :
Complete list of metadata

Contributor : Abes Star :  Contact
Submitted on : Wednesday, January 19, 2022 - 12:21:08 PM
Last modification on : Monday, April 4, 2022 - 9:28:32 AM
Long-term archiving on: : Wednesday, April 20, 2022 - 6:34:46 PM


Version validated by the jury (STAR)


  • HAL Id : tel-03534254, version 1


Katharina Boudgoust. Theoretical hardness of algebraically structured learning with errors. Cryptography and Security [cs.CR]. Université Rennes 1, 2021. English. ⟨NNT : 2021REN1S064⟩. ⟨tel-03534254⟩



Record views


Files downloads