Improvements on the Discrete Logarithm Problem in GF(p)
Résumé
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).
Domaines
Cryptographie et sécurité [cs.CR]Origine | Fichiers produits par l'(les) auteur(s) |
---|