Public Keys

  • Arjen K. Lenstra
  • James P. Hughes
  • Maxime Augier
  • Joppe W. Bos
  • Thorsten Kleinjung
  • Christophe Wachter
Conference paper

DOI: 10.1007/978-3-642-32009-5_37

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7417)
Cite this paper as:
Lenstra A.K., Hughes J.P., Augier M., Bos J.W., Kleinjung T., Wachter C. (2012) Public Keys. In: Safavi-Naini R., Canetti R. (eds) Advances in Cryptology – CRYPTO 2012. Lecture Notes in Computer Science, vol 7417. Springer, Berlin, Heidelberg

Abstract

We performed a sanity check of public keys collected on the web and found that the vast majority works as intended. Our main goal was to test the validity of the assumption that different random choices are made each time keys are generated. We found that this is not always the case, resulting in public keys that offer no security. Our conclusion is that generating secure public keys in the real world is challenging. We did not study usage of public keys.

Keywords

Sanity check public keys (batch) factoring discrete logarithm Euclidean algorithm seeding random number generators 
Download to read the full conference paper text

Copyright information

© International Association for Cryptologic Research 2012 2012

Authors and Affiliations

  • Arjen K. Lenstra
    • 1
  • James P. Hughes
    • 2
  • Maxime Augier
    • 1
  • Joppe W. Bos
    • 1
  • Thorsten Kleinjung
    • 1
  • Christophe Wachter
    • 1
  1. 1.EPFL IC LACALLausanneSwitzerland
  2. 2.SelfPalo AltoUSA

Personalised recommendations