Skip to Main content Skip to Navigation
Master thesis

Improvements on the Discrete Logarithm Problem in GF(p)

Razvan Barbulescu 1
1 CARAMEL - Cryptology, Arithmetic: Hardware and Software
Inria Nancy - Grand Est, LORIA - ALGO - Department of Algorithms, Computation, Image and Geometry
Abstract : This paper speeds up descrete logarithm algorithms in two ways. First we show how the Factorization Factory can be adapted to the discrete logarithm to drop the complexity from Lp(1/3,1.902) to Lp(1/3,1.639). Next we prove that an early abort strategy can decrease the complexity of the individual logarithm from Lp(1/3,1.447) to Lp(1/3,1.232).
Document type :
Master thesis
Complete list of metadata

Cited literature [26 references]  Display  Hide  Download
Contributor : Razvan Barbulescu Connect in order to contact the contributor
Submitted on : Monday, March 14, 2016 - 8:26:21 AM
Last modification on : Saturday, October 16, 2021 - 11:26:06 AM
Long-term archiving on: : Sunday, November 13, 2016 - 5:45:22 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License


  • HAL Id : inria-00588713, version 3



Razvan Barbulescu. Improvements on the Discrete Logarithm Problem in GF(p). Cryptography and Security [cs.CR]. 2011. ⟨inria-00588713v3⟩



Les métriques sont temporairement indisponibles