Universal Security

From Bits and Mips to Pools, Lakes – and Beyond
  • Arjen K. Lenstra
  • Thorsten Kleinjung
  • Emmanuel Thomé
Chapter
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8260)

Abstract

The relation between cryptographic key lengths and security depends on the cryptosystem used. This leads to confusion and to insecure parameter choices. In this note a universal security measure is proposed that puts all cryptographic primitives on the same footing, thereby making it easier to get comparable security across the board.

Keywords

Security Level Discrete Logarithm Cryptographic Primitive Cryptographic Hash Function Hash Length 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Arjen K. Lenstra
    • 1
  • Thorsten Kleinjung
    • 1
  • Emmanuel Thomé
    • 2
  1. 1.EPFL IC LACALLausanneSwitzerland
  2. 2.INRIA CNRS LORIA, Équipe CARAMEL - bâtiment AVillers-lès-Nancy CedexFrance

Personalised recommendations