Feb 20, 2013 · In this paper we propose a binary field variant of the Joux-Lercier medium-sized Function Field Sieve, which results not only in complexities as ...
Missing: F21971. | Show results with:F21971.
To illustrate the efficiency of the method, we have successfully solved the DLP in the finite fields with 21971 and 23164 elements, setting a record for binary ...
Missing: F21971. | Show results with:F21971.
Feb 2, 2017 · We present an algorithm for computing discrete logarithms with which we prove that for each prime $p$ there exist infinitely many explicit ...
Missing: F21971. | Show results with:F21971.
On the Function Field Sieve and the Impact of Higher Splitting Probabilities: Application to Discrete Logarithms in F21971 · Mathematics, Computer Science. IACR ...
Apr 13, 2016 · Zumbrägel, “On the function field sieve and the impact of higher splitting probabilities: application to discrete logarithms in. F21971 and ...
On the Function Field Sieve and the Impact of Higher Splitting Probabilities: Application to Discrete Logarithms in F21971 · Faruk GöloğluR. GrangerG. McGuire ...
On the function field sieve and the impact of higher splitting probabilities: Application to discrete loga- rithms in F21971 and F23164 . In Ran Canetti and ...
Aug 25, 2022 · On the function field sieve and the impact of higher splitting probabilities: Application to discrete logarithms in F21971 and F23164 . In ...
McGuire and J. Zumbrägel, “On the function field sieve and the impact of higher splitting probabilities: Application to discrete logarithms in F21971 ”, ...
Jun 18, 2013 · On the function field sieve and the impact of higher splitting probabilities: Application to discrete logarithms in F21971 . Cryptology ...