Skip to Main content Skip to Navigation
Reports

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 :
Reports
Complete list of metadata

https://hal.inria.fr/inria-00588713
Contributor : Razvan Barbulescu Connect in order to contact the contributor
Submitted on : Tuesday, April 26, 2011 - 11:13:49 AM
Last modification on : Saturday, October 16, 2021 - 11:26:06 AM
Long-term archiving on: : Thursday, November 8, 2012 - 5:16:17 PM

File

DLP_in_GF_p_.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00588713, version 1

Citation

Razvan Barbulescu. Improvements on the Discrete Logarithm Problem in GF(p). [Internship report] 2011. ⟨inria-00588713v1⟩

Share

Metrics

Les métriques sont temporairement indisponibles