Computation of a 768-bit prime field discrete logarithm

DOI10.1007/978-3-319-56620-7_7MaRDI QIDQ5738876zbMATH OpenOpenAlexFDO

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

Publication date 13 June 2017

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-56620-7_7

zbMATH Keywords

discrete logarithmDSAel-Gamalnumber field sieve

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16) Cryptography (94A60)

Recommendations

• Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method
• scientific article; zbMATH DE number 1676635
• scientific article; zbMATH DE number 1113854
• The Number Field Sieve in the Medium Prime Case
• New discrete logarithm computation for the medium prime case using the function field sieve

Cites work

• A method for obtaining digital signatures and public-key cryptosystems
• A public key cryptosystem and a signature scheme based on discrete logarithms
• A tale of two sieves.
• Algorithmic Number Theory
• Analysis of Coppersmith's Block Wiedemann Algorithm for the Parallel Solution of Sparse Linear Systems
• Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve
• Factorization of a 768-Bit RSA Modulus
• scientific article; zbMATH DE number 475434 (Why is no real title available?)
• scientific article; zbMATH DE number 2081059 (Why is no real title available?)
• Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method
• Improving the Polynomial time Precomputation of Frobenius Representation Discrete Logarithm Algorithms
• Mersenne factorization factory
• Modifications to the number field sieve
• Selecting cryptographic key sizes
• Solving Homogeneous Linear Equations Over GF(2) via Block Wiedemann Algorithm
• Solving sparse linear equations over finite fields
• The development of the number field sieve
• The Factorization of the Ninth Fermat Number
• Virtual logarithms

Cited in

(11)

• The point decomposition problem over hyperelliptic curves, Toward efficient computation of discrete logarithms in even characteristic
• Updating key size estimations for pairings
• Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment
• Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation
• scientific article; zbMATH DE number 708805 (Why is no real title available?)
• Faster individual discrete logarithms in finite fields of composite extension degree
• Computation of a 30750-bit binary field discrete logarithm
• A brief history of pairings
• Progress in Cryptology - INDOCRYPT 2003
• Higher-dimensional sieving for the number field sieve algorithms
• On the alpha value of polynomials in the tower number field sieve algorithm

This page was built for publication: Computation of a 768-bit prime field discrete logarithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5738876)