A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic
Authors:
Top Cited Papers
- 1 January 2014
- book chapter
- Published by Springer Nature
- Vol. 2013, 1-16
Abstract
No abstract availableKeywords
All Related Versions
This publication has 14 references indexed in Scilit:
- A New Index Calculus Algorithm with Complexity $L(1/4+o(1))$ in Small Characteristic2014
- Weakness of $\mathbb{F}_{3^{6 \cdot 509}}$ for Discrete Logarithm Cryptography2014
- On the Function Field Sieve and the Impact of Higher Splitting ProbabilitiesLecture Notes in Computer Science, 2013
- Faster Index Calculus for the Medium Prime Case Application to 1175-bit and 1425-bit Finite FieldsLecture Notes in Computer Science, 2013
- The function field sieve1994
- Discrete Logarithms in $GF ( P )$ Using the Number Field SieveSIAM Journal on Discrete Mathematics, 1993
- Fast evaluation of logarithms in fields of characteristic twoIEEE Transactions on Information Theory, 1984
- Computing Logarithms in Finite Fields of Characteristic TwoSIAM Journal on Algebraic Discrete Methods, 1984
- A subexponential algorithm for the discrete logarithm problem with applications to cryptography1979
- New directions in cryptographyIEEE Transactions on Information Theory, 1976