Skip to main content
Conference ProceedingsOPEN ACCESS

Computation of a 768-bit prime field discrete logarithm

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2017) 10210 LNCS 185-201
DOI: 10.1007/978-3-319-56620-7_7
19Citations
Citations of this article
29Readers
Mendeley users who have this article in their library.

This article is free to access.

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.

Author supplied keywords

Cite

CITATION STYLE

APA

Kleinjung, T., Diem, C., Lenstra, A. K., Priplata, C., & Stahlke, C. (2017). Computation of a 768-bit prime field discrete logarithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10210 LNCS, pp. 185–201). Springer Verlag. https://doi.org/10.1007/978-3-319-56620-7_7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free