Paper 2017/067

Computation of a 768-bit prime field discrete logarithm

Thorsten Kleinjung, Claus Diem, Arjen K. Lenstra, Christine Priplata, and Colin Stahlke

Abstract

This paper reports on the number field sieve computation of a 768-bit prime field discrete logarithm, describes the different parameter optimizations and resulting algorithmic changes compared to the factorization of a 768-bit RSA modulus, and briefly discusses the cryptologic relevance of the result.

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
Published by the IACR in EUROCRYPT 2017
Keywords
Discrete logarithmDSAElGamalnumber field sieve
Contact author(s)
akl @ epfl ch
History
2017-03-29: last of 4 revisions
2017-01-31: received
See all versions
Short URL
https://ia.cr/2017/067
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2017/067,
      author = {Thorsten Kleinjung and Claus Diem and Arjen K.  Lenstra and Christine Priplata and Colin Stahlke},
      title = {Computation of a 768-bit prime field discrete logarithm},
      howpublished = {Cryptology ePrint Archive, Paper 2017/067},
      year = {2017},
      note = {\url{https://eprint.iacr.org/2017/067}},
      url = {https://eprint.iacr.org/2017/067}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.