On the public citation graph

Faster individual discrete logarithms in finite fields of composite extension degree

https://doi.org/10.1090/mcom/3376
0 signed · 47 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/inco.1998.2761openalex-snapshot
Function Field Sieve Method for Discrete Logarithms over Finite Fields
inferredcites →https://doi.org/10.1006/jagm.2001.1158openalex-snapshot
The Complete Analysis of a Polynomial Factorization Algorithm over Finite Fields
inferredcites →https://doi.org/10.1007/11426639_14openalex-snapshot
Practical Cryptography in High Dimensional Tori
inferredcites →https://doi.org/10.1007/11745853_12openalex-snapshot
An Algorithm to Solve the Discrete Logarithm Problem with the Number Field Sieve
inferredcites →https://doi.org/10.1007/11818175_19openalex-snapshot
The Number Field Sieve in the Medium Prime Case
inferredcites →https://doi.org/10.1007/3-540-39568-7_8openalex-snapshot
Computing Logarithms in GF (2n)
inferredcites →https://doi.org/10.1007/3-540-39757-4_20openalex-snapshot
Discrete logarithms in finite fields and their cryptographic significance
inferredcites →https://doi.org/10.1007/3-540-45455-1_34openalex-snapshot
The Function Field Sieve Is Quite Special
inferredcites →https://doi.org/10.1007/3-540-58691-1_48openalex-snapshot
The function field sieve
inferredcites →https://doi.org/10.1007/978-3-319-56620-7_7openalex-snapshot
Computation of a 768-Bit Prime Field Discrete Logarithm
inferredcites →https://doi.org/10.1007/978-3-540-28628-8_10openalex-snapshot
Asymptotically Optimal Communication for Torus-Based Cryptography
inferredcites →https://doi.org/10.1007/978-3-642-55220-5_1openalex-snapshot
A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic
inferredcites →https://doi.org/10.1007/978-3-662-43414-7_18openalex-snapshot
A New Index Calculus Algorithm with Complexity $$L(1/4+o(1))$$ in Small Characteristic
inferredcites →https://doi.org/10.1007/978-3-662-46800-5_6openalex-snapshot
Improving NFS for the Discrete Logarithm Problem in Non-prime Finite Fields
inferredcites →https://doi.org/10.1007/978-3-662-48800-3_2openalex-snapshot
The Tower Number Field Sieve
inferredcites →https://doi.org/10.1007/978-3-662-49890-3_11openalex-snapshot
Improved Masking for Tweakable Blockciphers with Applications to Authenticated Encryption
inferredcites →https://doi.org/10.1007/978-3-662-49890-3_17openalex-snapshot
New Complexity Trade-Offs for the (Multiple) Number Field Sieve Algorithm in Non-Prime Fields
inferredcites →https://doi.org/10.1007/978-3-662-53018-4_20openalex-snapshot
Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case
inferredcites →https://doi.org/10.1007/978-3-662-53887-6_2openalex-snapshot
A General Polynomial Selection Method and New Asymptotic Complexities for the Tower Number Field Sieve Algorithm
inferredcites →https://doi.org/10.1007/978-3-662-54365-8_16openalex-snapshot
Extended Tower Number Field Sieve with Application to Finite Fields of Arbitrary Composite Extension Degree
inferredcites →https://doi.org/10.1007/bf00123958openalex-snapshot
Computation of discrete logarithms in prime fields
inferredcites →https://doi.org/10.1007/bf01457454openalex-snapshot
Factoring polynomials with rational coefficients
inferredcites →https://doi.org/10.1007/bf01840433openalex-snapshot
Discrete logarithms inGF(p)
inferredcites →https://doi.org/10.1016/j.ffa.2014.10.009openalex-snapshot
Weakness of F36⋅1429 and F24⋅3041 for discrete logarithm cryptography
inferredcites →https://doi.org/10.1023/a:1016521712726openalex-snapshot
A Rigorous Proof of the Waterloo Algorithm for the Discrete Logarithm Problem
inferredcites →https://doi.org/10.1090/s0025-5718-02-01482-5openalex-snapshot
Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method
inferredcites →https://doi.org/10.1098/rsta.1993.0138openalex-snapshot
A hyperelliptic smoothness test. I
inferredcites →https://doi.org/10.1098/rsta.1993.0139openalex-snapshot
Discrete logarithms and local units
inferredcites →https://doi.org/10.1109/tit.1976.1055638openalex-snapshot
New directions in cryptography
inferredcites →https://doi.org/10.1112/plms/84.1.105openalex-snapshot
A Hyperelliptic Smoothness Test, II
inferredcites →https://doi.org/10.1137/0406010openalex-snapshot
Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve
inferredcites →https://doi.org/10.1137/0605029openalex-snapshot
Computing Logarithms in Finite Fields of Characteristic Two
inferredcites →https://doi.org/10.1145/3549993.3550007openalex-snapshot
New Directions in Cryptography
inferredcites →https://doi.org/10.1201/b15006openalex-snapshot
Handbook of Finite Fields
inferredcites →https://doi.org/10.3934/amc.2018044openalex-snapshot
Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-030-92062-3_3openalex-snapshot
Lattice Enumeration for Tower NFS: A 521-Bit Discrete Logarithm Computation
inferred← citeshttps://doi.org/10.1007/s00145-023-09487-xopenalex-snapshot
Lattice Enumeration and Automorphisms for Tower NFS: A 521-Bit Discrete Logarithm Computation
inferred← citeshttps://doi.org/10.1007/s10623-023-01282-wopenalex-snapshot
Individual discrete logarithm with sublattice reduction
inferred← citeshttps://doi.org/10.1007/s10623-025-01590-3openalex-snapshot
Utilizing two subfields to accelerate individual logarithm computation in extended tower number field sieve
inferred← citeshttps://doi.org/10.1016/j.ffa.2019.101629openalex-snapshot
Faster initial splitting for small characteristic composite extension degree fields
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.01.010openalex-snapshot
Refined analysis to the extended tower number field sieve
inferred← citeshttps://doi.org/10.1109/tit.2023.3244631openalex-snapshot
Constructing CM Fields for NFS to Accelerate DL Computation in Non-Prime Finite Fields
inferred← citeshttps://doi.org/10.1515/jmc-2020-0008openalex-snapshot
Lattice Sieving in Three Dimensions for Discrete Log in Medium Characteristic
inferred← citeshttps://doi.org/10.48550/arxiv.2001.10860openalex-snapshot
A New Angle on Lattice Sieving for the Number Field Sieve
inferred← citeshttps://doi.org/10.62056/ah2ip2fgxopenalex-snapshot
Discrete Logarithm Factory
inferred← citeshttps://doi.org/10.70675/03e70022z3b51z4264z86ffz300c571650d3openalex-snapshot
Discrete Logarithm Cryptanalyses : Number Field Sieve and Lattice Tools for Side-Channel Attacks
inferred← citeshttps://doi.org/10.70675/dc2bc96dz4f43z463fza85ez090235d220eeopenalex-snapshot
The Discrete Logarithm Problem in Finite Fields with Extensions
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.