Computation of a 768-Bit Prime Field Discrete Logarithm
Kleinjung, Thorsten; Diem, Claus; Lenstra, Arjen K.; Priplata, Christine; Stahlke, Colin
2017

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.

Details

Title Computation of a 768-Bit Prime Field Discrete Logarithm
Author(s) Kleinjung, Thorsten ; Diem, Claus ; Lenstra, Arjen K. ; Priplata, Christine ; Stahlke, Colin
Published in Advances In Cryptology - Eurocrypt 2017, Pt I
Pagination 17
Editor(s)
Series Lecture Notes in Computer Science
Volume 10210
Pages 185-201
Conference 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT), Paris, FRANCE, APR 30-MAY 04, 2017
Date 2017
Publisher Cham, Springer International Publishing Ag
ISSN 0302-9743
ISBN 978-3-319-56620-7
978-3-319-56619-1
Keywords
DOI https://doi.org/10.1007/978-3-319-56620-7_7
Other identifier(s) View record in Web of Science
Laboratories LACAL
Record Appears in Scientific production and competences > I&C - School of Computer and Communication Sciences > IINFCOM > LACAL - Laboratory for cryptologic algorithms
Peer-reviewed publications
Conference Papers
Work produced at EPFL
Published
Record creation date 2018-01-15