Cryptology ePrint Archive: Report 2017/067

Computation of a 768-bit prime field discrete logarithm

Thorsten Kleinjung and Claus Diem and Arjen K. Lenstra and 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.

Category / Keywords: public-key cryptography / Discrete logarithm, DSA, ElGamal, number field sieve

Original Publication (in the same form): IACR-EUROCRYPT-2017

Date: received 31 Jan 2017, last revised 29 Mar 2017

Contact author: akl at epfl ch

Available format(s): PDF | BibTeX Citation

Version: 20170329:123118 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]