On the public citation graph

Computing discrete logarithms with quadratic number rings

https://doi.org/10.1007/bfb0054125
0 signed · 31 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.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_45openalex-snapshot
A multiple polynomial general 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/bf01840433openalex-snapshot
Discrete logarithms inGF(p)
inferredcites →https://doi.org/10.1007/bfb0055747openalex-snapshot
The solution of McCurley's discrete log challenge
inferredcites →https://doi.org/10.1007/bfb0091539openalex-snapshot
Factoring integers with 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.1098/rsta.1993.0139openalex-snapshot
Discrete logarithms and local units
inferredcites →https://doi.org/10.1109/tit.1978.1055817openalex-snapshot
An improved algorithm for computing logarithms overGF(p)and its cryptographic significance (Corresp.)
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-25895openalex-snapshot
On the computation of discrete logarithms in finite prime fields
inferredcites →https://doi.org/10.5860/choice.46-6857openalex-snapshot
Introduction to 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.1007/3-540-35041-1_2openalex-snapshot
Logistikmanagement als Management der Logistikfunktion
inferred← citeshttps://doi.org/10.1007/978-3-030-73492-3_13openalex-snapshot
Cycles, Randomness, Discrete Logarithms, and Key Exchange
inferred← citeshttps://doi.org/10.1007/978-3-031-50432-7_13openalex-snapshot
Zyklen, Zufälligkeit, diskrete Logarithmen und Schlüsselaustausch
inferred← citeshttps://doi.org/10.1007/978-3-322-84957-1_30openalex-snapshot
A Survey of Cryptosystems Based on Imaginary Quadratic Orders
inferred← citeshttps://doi.org/10.1007/978-3-322-84957-1_9openalex-snapshot
Wie sicher ist die Public-Key-Kryptographie?
inferred← citeshttps://doi.org/10.1007/978-3-540-48000-6_18openalex-snapshot
Reducing Logarithms in Totally Non-maximal Imaginary Quadratic Orders to Logarithms in Finite Fields
inferred← citeshttps://doi.org/10.1007/978-3-642-57189-3_4openalex-snapshot
Discrete Logarithms: Recent Progress
inferred← citeshttps://doi.org/10.1007/978-3-662-48784-6_2openalex-snapshot
Logistikmanagement als Management der Logistikfunktion
inferred← citeshttps://doi.org/10.1007/978-3-662-48797-6_7openalex-snapshot
Computing Individual Discrete Logarithms Faster in $${{\mathrm{GF}}}(p^n)$$ with the NFS-DL Algorithm
inferred← citeshttps://doi.org/10.1007/bfb0055747openalex-snapshot
The solution of McCurley's discrete log challenge
inferred← citeshttps://doi.org/10.1007/springerreference_197openalex-snapshot
Data encryption standard (DES)
inferred← citeshttps://doi.org/10.1017/9781316271575.006openalex-snapshot
General Purpose Integer Factoring
inferred← citeshttps://doi.org/10.1023/a:1008350005447openalex-snapshot
Discrete Logarithms: The Past and the Future
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.1109/cits49457.2020.9232505openalex-snapshot
Improvements to the Descent Step in the Number Field Sieve for Discrete Logarithms
inferred← citeshttps://doi.org/10.25911/5d6272199e44dopenalex-snapshot
Polynomial selection for the number field sieve integer factorisation algorithm
inferred← citeshttps://doi.org/10.4213/mvk3openalex-snapshot
Об использовании групп классов идеалов квадратичных полей для построения криптографических систем с открытым ключом
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.