Paper 2019/655

Visualizing size-security tradeoffs for lattice-based encryption

Daniel J. Bernstein

Abstract

There are many proposed lattice-based encryption systems. How do these systems compare in the security that they provide against known attacks, under various limits on communication volume? There are several reasons to be skeptical of graphs that claim to answer this question. Part of the problem is with the underlying data points, and part of the problem is with how the data points are converted into graphs.

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
Preprint. MINOR revision.
Keywords
lattice-based cryptographysecurity estimatesnetwork trafficPareto frontsvisualization
Contact author(s)
authorcontact-paretoviz @ box cr yp to
History
2019-06-04: received
Short URL
https://ia.cr/2019/655
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2019/655,
      author = {Daniel J.  Bernstein},
      title = {Visualizing size-security tradeoffs for lattice-based encryption},
      howpublished = {Cryptology ePrint Archive, Paper 2019/655},
      year = {2019},
      note = {\url{https://eprint.iacr.org/2019/655}},
      url = {https://eprint.iacr.org/2019/655}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.