On the discrete logarithm problem in finite fields of fixed characteristic
- Submitting institution
-
The University of Surrey
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 9026475_3
- Type
- D - Journal article
- DOI
-
10.1090/tran/7027
- Title of journal
- Transactions of the American Mathematical Society
- Article number
- -
- First page
- 3129
- Volume
- 370
- Issue
- 5
- ISSN
- 0002-9947
- Open access status
- Compliant
- Month of publication
- -
- Year of publication
- 2016
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
-
- Research group(s)
-
-
- Citation count
- 6
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- The Discrete Logarithm Problem (DLP) has been a foundational hard problem in public-key cryptography since its inception in 1976. This work presents a rigorous algorithmic breakthrough which provably solves the problem for these fields in quasi-polynomial time for infinitely many cases. Such proofs are exceptionally rare in mathematical cryptology. The algorithm was used to solve a DLP in a field of bitlength 30750 greatly surpassing the previous record of 9234. This has led to three additional invited articles, a book chapter, and twelve invited talks. The approach underpinned a recent extension to provably solve the problem for all such cases.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -