On the public citation graph
The solution of McCurley's discrete log challenge
0 signed · 63 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-38424-3_8openalex-snapshot
Solving Large Sparse Linear Systems Over Finite Fields
inferredcites →https://doi.org/10.1007/3-540-49264-x_8openalex-snapshot
An Implementation of the General Number Field Sieve to Compute Discrete Logarithms mod p
inferredcites →https://doi.org/10.1007/3-540-61581-4_43openalex-snapshot
On the reduction of composed relations from the number field sieve
inferredcites →https://doi.org/10.1007/3-540-61581-4_66openalex-snapshot
Discrete logarithms: The effectiveness of the index calculus method
inferredcites →https://doi.org/10.1007/3-540-61581-4_70openalex-snapshot
Computing discrete logarithms with the general number field sieve
inferredcites →https://doi.org/10.1007/978-1-4899-3585-4openalex-snapshot
Unsolved Problems in Number Theory
inferredcites →https://doi.org/10.1007/bf00123958openalex-snapshot
Computation of discrete logarithms in prime fields
inferredcites →https://doi.org/10.1007/bfb0054125openalex-snapshot
Computing discrete logarithms with quadratic number rings
inferredcites →https://doi.org/10.1007/bfb0091534openalex-snapshot
The development of the number field sieve
inferredcites →https://doi.org/10.1016/0304-3975(76)90050-5openalex-snapshot
Analysis of a simple factorization algorithm
inferredcites →https://doi.org/10.1090/psapm/042/1095551openalex-snapshot
The discrete logarithm problem
inferredcites →https://doi.org/10.1090/s0025-5718-1985-0777282-xopenalex-snapshot
Modular Multiplication Without Trial Division
inferredcites →https://doi.org/10.1098/rsta.1993.0139openalex-snapshot
Discrete logarithms and local units
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/tit.1976.1055638openalex-snapshot
New directions in cryptography
inferredcites →https://doi.org/10.1109/tit.1985.1057074openalex-snapshot
A public key cryptosystem and a signature scheme based on discrete logarithms
inferredcites →https://doi.org/10.1137/0406010openalex-snapshot
Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve
inferredcites →https://doi.org/10.22028/d291-25756openalex-snapshot
Faktorisieren mit dem Number Field Sieve
inferredcites →https://doi.org/10.22028/d291-25831openalex-snapshot
LiDIA : a library for computational number theory
inferredcites →https://doi.org/10.22028/d291-25895openalex-snapshot
On the computation of discrete logarithms in finite prime fields
inferredcites →https://doi.org/10.2307/1971363openalex-snapshot
Factoring Integers with Elliptic Curves
inferredcites →https://doi.org/10.2307/2004020openalex-snapshot
Solved and Unsolved Problems in Number Theory
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9781118188606.ch8openalex-snapshot
Discrete Logarithm Based Cryptography
inferred← citeshttps://doi.org/10.1006/jsco.2002.0533openalex-snapshot
Subquadratic Computation of Vector Generating Polynomials and Improvement of the Block Wiedemann Algorithm
inferred← citeshttps://doi.org/10.1007/3-540-44983-3_20openalex-snapshot
Towards Practical Non-interactive Public Key Cryptosystems Using Non-maximal Imaginary Quadratic Orders (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/3-540-44987-6_3openalex-snapshot
How Secure Are Elliptic Curves over Composite Extension Fields?
inferred← citeshttps://doi.org/10.1007/3-540-45455-1_34openalex-snapshot
The Function Field Sieve Is Quite Special
inferred← citeshttps://doi.org/10.1007/3-540-45539-6_2openalex-snapshot
An Algorithm for Solving the Discrete Log Problem on Hyperelliptic Curves
inferred← citeshttps://doi.org/10.1007/3-540-45682-1_7openalex-snapshot
Computation of Discrete Logarithms in $$ \mathbb{F}_{2^{607} } $$
inferred← citeshttps://doi.org/10.1007/3-540-46632-0_30openalex-snapshot
Performance Comparison of Linear Sieve and Cubic Sieve Algorithms for Discrete Logarithms over Prime Fields
inferred← citeshttps://doi.org/10.1007/978-1-4419-7722-9_3openalex-snapshot
Quantum Attacks on DLP-Based Cryptosystems
inferred← citeshttps://doi.org/10.1007/978-1-4419-7722-9_4openalex-snapshot
Quantum Attacks on ECDLP-Based Cryptosystems
inferred← citeshttps://doi.org/10.1007/978-3-031-22944-2_5openalex-snapshot
Finite Field Arithmetic in Large Characteristic for Classical and Post-quantum Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-319-04852-9_1openalex-snapshot
Efficient and Secure Algorithms for GLV-Based Scalar Multiplication and Their Implementation on GLV-GLS Curves
inferred← citeshttps://doi.org/10.1007/978-3-319-25823-2_4openalex-snapshot
Quantum Computing for Discrete Logarithms
inferred← citeshttps://doi.org/10.1007/978-3-319-72536-9_6openalex-snapshot
Logarithm Based Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-642-20465-4_5openalex-snapshot
Faster Explicit Formulas for Computing Pairings over Ordinary Curves
inferred← citeshttps://doi.org/10.1007/978-3-642-33481-8_10openalex-snapshot
Faster Implementation of Scalar Multiplication on Koblitz Curves
inferred← citeshttps://doi.org/10.1007/978-3-642-42001-6_8openalex-snapshot
An Experiment of Number Field Sieve for Discrete Logarithm Problem over GF(p 12)
inferred← citeshttps://doi.org/10.1007/978-3-642-57189-3_4openalex-snapshot
Discrete Logarithms: Recent Progress
inferred← citeshttps://doi.org/10.1007/bfb0054125openalex-snapshot
Computing discrete logarithms with quadratic number rings
inferred← citeshttps://doi.org/10.1007/s10623-020-00727-wopenalex-snapshot
Cocks–Pinch curves of embedding degrees five to eight and optimal ate pairing computation
inferred← citeshttps://doi.org/10.1007/s13389-012-0029-zopenalex-snapshot
Efficient software implementation of public-key cryptography on sensor networks using the MSP430X microcontroller
inferred← citeshttps://doi.org/10.1007/s13389-014-0085-7openalex-snapshot
Efficient and secure algorithms for GLV-based scalar multiplication and their implementation on GLV–GLS curves (extended version)
inferred← citeshttps://doi.org/10.1007/s13389-015-0094-1openalex-snapshot
Fast software implementation of binary elliptic curve cryptography
inferred← citeshttps://doi.org/10.1007/springerreference_197openalex-snapshot
Data encryption standard (DES)
inferred← citeshttps://doi.org/10.1016/j.eswa.2020.114047openalex-snapshot
An alternative practical public-key cryptosystems based on the Dependent RSA Discrete Logarithm Problems
inferred← citeshttps://doi.org/10.1016/j.mcm.2011.02.022openalex-snapshot
Discrete logarithm problem using index calculus method
inferred← citeshttps://doi.org/10.1023/a:1008350005447openalex-snapshot
Discrete Logarithms: The Past and the Future
inferred← citeshttps://doi.org/10.1080/120716031000120827openalex-snapshot
On the cubic sieve method for computing discrete logarithms over prime fields
inferred← citeshttps://doi.org/10.1090/s0025-5718-00-01308-9openalex-snapshot
Special prime numbers and discrete logs in finite prime fields
inferred← citeshttps://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
inferred← citeshttps://doi.org/10.1090/s0025-5718-99-01137-0openalex-snapshot
Using number fields to compute logarithms in finite fields
inferred← citeshttps://doi.org/10.1109/artcom.2009.62openalex-snapshot
Methods to Solve Discrete Logarithm Problem for Ephemeral Keys
inferred← citeshttps://doi.org/10.1109/candar.2019.00030openalex-snapshot
A Performance Analysis and Evaluation of SIDH with Implementation-Friendly Classes of Quadratic Extension Fields
inferred← citeshttps://doi.org/10.1109/itc-cscc.2019.8793376openalex-snapshot
An Implementation and Evaluation of Pairing Library ELiPS for BLS Curve with Several Techniques
inferred← citeshttps://doi.org/10.1145/384101.384145openalex-snapshot
Fast computation of linear generators for matrix sequences and application to the block Wiedemann algorithm
inferred← citeshttps://doi.org/10.18926/49322openalex-snapshot
Lazy Random Walk Efficient for Pollard’s Rho Methoｄ Attacking on G3 over Barreto-Naehrig Curve (Corrected)
inferred← citeshttps://doi.org/10.25911/5d6272199e44dopenalex-snapshot
Polynomial selection for the number field sieve integer factorisation algorithm
inferred← citeshttps://doi.org/10.46586/tches.v2023.i3.445-472openalex-snapshot
Efficient Algorithms for Large Prime Characteristic Fields and Their Application to Bilinear Pairings
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.