Jump to ContentJump to Main Navigation
Show Summary Details
More options …

Journal of Mathematical Cryptology

Managing Editor: Magliveras, Spyros S. / Steinwandt, Rainer / Trung, Tran

Editorial Board Member: Blackburn, Simon R. / Blundo, Carlo / Burmester, Mike / Cramer, Ronald / Dawson, Ed / Gilman, Robert / Gonzalez Vasco, Maria Isabel / Grosek, Otokar / Helleseth, Tor / Kim, Kwangjo / Koblitz, Neal / Kurosawa, Kaoru / Lauter, Kristin / Lange, Tanja / Menezes, Alfred / Nguyen, Phong Q. / Pieprzyk, Josef / Rötteler, Martin / Safavi-Naini, Rei / Shparlinski, Igor E. / Stinson, Doug / Takagi, Tsuyoshi / Williams, Hugh C. / Yung, Moti

4 Issues per year


CiteScore 2016: 0.74

SCImago Journal Rank (SJR) 2016: 0.463
Source Normalized Impact per Paper (SNIP) 2016: 0.778

Mathematical Citation Quotient (MCQ) 2016: 0.16

Online
ISSN
1862-2984
See all formats and pricing
More options …

On the concrete hardness of Learning with Errors

Martin R. Albrecht / Rachel Player / Sam Scott
Published Online: 2015-10-02 | DOI: https://doi.org/10.1515/jmc-2015-0016

Abstract

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 to run them. We consider both generic instances of LWE as well as small secret variants. Since for several methods of solving LWE we require a lattice reduction step, we also review lattice reduction algorithms and use a refined model for estimating their running times. We also give concrete estimates for various families of LWE instances, provide a Sage module for computing these estimates and highlight gaps in the knowledge about algorithms for solving the LWE problem.

Keywords: Learning with Errors; lattice-based cryptography; lattice reduction

MSC: 94A60; 11T71

About the article

Received: 2015-03-19

Revised: 2015-09-20

Accepted: 2015-09-24

Published Online: 2015-10-02

Published in Print: 2015-10-01


Funding Source: EPSRC

Award identifier / Grant number: EP/L018543/1

Funding Source: ACE-CSR PhD grant

Funding Source: EPSRC

Award identifier / Grant number: EP/K035584/1


Citation Information: Journal of Mathematical Cryptology, ISSN (Online) 1862-2984, ISSN (Print) 1862-2976, DOI: https://doi.org/10.1515/jmc-2015-0016.

Export Citation

© 2015 by De Gruyter. Copyright Clearance Center

Citing Articles

Here you can find all Crossref-listed publications in which this article is cited. If you would like to receive automatic email messages as soon as this article is cited in other publications, simply activate the “Citation Alert” on the top of this page.

[1]
Kristin Lauter
IEEE Security & Privacy, 2017, Volume 15, Number 4, Page 22
[2]
Gizem S. Çetin, Hao Chen, Kim Laine, Kristin Lauter, Peter Rindal, and Yuhou Xia
BMC Medical Genomics, 2017, Volume 10, Number S2
[3]
Claudia Patricia Renteria-Mejia and Jaime Velasco-Medina
IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2017, Volume 25, Number 8, Page 2332
[4]
Christopher Huth, Daniela Becker, Jorge Guajardo Merchan, Paul Duplys, and Tim Guneysu
IEEE Access, 2017, Volume 5, Page 11909
[5]
Tsuyoshi TAKAGI
IEICE ESS Fundamentals Review, 2017, Volume 11, Number 1, Page 17

Comments (0)

Please log in or register to comment.
Log in