Skip to Main content Skip to Navigation
Journal articles

A general framework for subexponential discrete logarithm algorithms

Abstract : We describe a generic algorithm for computing discrete logarithms in groups of known order in which a smoothness concept is available. The running time of the algorithm can be proved without using any heuristics and leads to a subexponential complexity in particular for finite fields and class groups of number and function fields which were proposed for use in cryptography. In class groups, our algorithm is substantially faster than previously suggested ones. The subexponential complexity is obtained for cyclic groups in which a certain smoothness assumption is satisfied. We also show how to modify the algorithm for cyclic subgroups of arbitrary groups when the smoothness assumption can only be verified for the full group.
Document type :
Journal articles
Complete list of metadata

Cited literature [36 references]  Display  Hide  Download

https://hal.inria.fr/inria-00512717
Contributor : Pierrick Gaudry Connect in order to contact the contributor
Submitted on : Tuesday, August 31, 2010 - 1:35:32 PM
Last modification on : Thursday, March 5, 2020 - 6:21:45 PM
Long-term archiving on: : Wednesday, December 1, 2010 - 2:45:38 AM

File

acta.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Andreas Enge, Pierrick Gaudry. A general framework for subexponential discrete logarithm algorithms. Acta Arithmetica, Instytut Matematyczny PAN, 2002, 102, pp.83-103. ⟨10.4064/aa102-1-6⟩. ⟨inria-00512717⟩

Share

Metrics

Record views

359

Files downloads

418