Improvements on the Discrete Logarithm Problem in GF(p) - Archive ouverte HAL Access content directly
Master Thesis Year : 2011

Improvements on the Discrete Logarithm Problem in GF(p)

(1)
1

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).
Fichier principal
Vignette du fichier
hal.pdf (883.41 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00588713 , version 1 (26-04-2011)
inria-00588713 , version 2 (02-05-2011)
inria-00588713 , version 3 (14-03-2016)

Licence

Attribution - CC BY 4.0

Identifiers

  • HAL Id : inria-00588713 , version 3

Cite

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

Share

Gmail Facebook Twitter LinkedIn More