On the concrete hardness of Learning with Errors

The learning with errors (LWE) problem has become a central building block of modern cryptographic constructions. This work collects and presents hardness results for concrete instances of LWE. In particular, we discuss algorithms proposed in the literature and give the expected resources required t...

Full description

Saved in:
Bibliographic Details
Published inJournal of mathematical cryptology Vol. 9; no. 3; pp. 169 - 203
Main Authors Albrecht, Martin R., Player, Rachel, Scott, Sam
Format Journal Article
LanguageEnglish
Published Berlin De Gruyter 01.10.2015
Walter de Gruyter GmbH
Subjects
Online AccessGet full text

Cover

Loading…