On the public citation graph

A note on discrete logarithms in finite fields

https://doi.org/10.1007/bf01189026
0 signed · 26 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-39757-4_20openalex-snapshot
Discrete logarithms in finite fields and their cryptographic significance
inferredcites →https://doi.org/10.1007/bf01810847openalex-snapshot
A short proof for explicit formulas for discrete logarithms in finite fields
inferredcites →https://doi.org/10.1017/cbo9781139172769openalex-snapshot
Introduction to Finite Fields and their Applications
inferredcites →https://doi.org/10.1090/s0025-5718-1971-0301966-0openalex-snapshot
The Fast Fourier Transform in a Finite Field
inferredcites →https://doi.org/10.1109/tit.1984.1056986openalex-snapshot
A polynomial form for logarithms modulo a prime (Corresp.)
inferredcites →https://doi.org/10.4064/aa-47-3-255-261openalex-snapshot
A polynomial representation for logarithms in GF(q)

What points at this work

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

inferred← citeshttps://doi.org/10.1002/anac.200410027openalex-snapshot
Aitken and Neville Inverse Interpolation Methods over Finite Fields
inferred← citeshttps://doi.org/10.1007/11779360_12openalex-snapshot
Interpolation of Functions Related to the Integer Factoring Problem
inferred← citeshttps://doi.org/10.1007/978-3-031-58641-5_21openalex-snapshot
Neural Network in Elliptic Curve Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-319-18275-9_1openalex-snapshot
Transformations of Cryptographic Schemes Through Interpolation Techniques
inferred← citeshttps://doi.org/10.1007/978-3-540-69499-1_1openalex-snapshot
Interpolation of the Double Discrete Logarithm
inferred← citeshttps://doi.org/10.1007/978-3-540-71078-3_1openalex-snapshot
Cryptography and Cryptanalysis Through Computational Intelligence
inferred← citeshttps://doi.org/10.1007/978-3-642-03564-7_21openalex-snapshot
Polynomial Interpolation of the k-th Root of the Discrete Logarithm
inferred← citeshttps://doi.org/10.1007/s00574-023-00341-zopenalex-snapshot
Pairs of r-Primitive and k-Normal Elements in Finite Fields
inferred← citeshttps://doi.org/10.1007/s11139-023-00785-3openalex-snapshot
Inverses of r-primitive k-normal elements over finite fields
inferred← citeshttps://doi.org/10.1016/j.dam.2005.03.030openalex-snapshot
Polynomial interpolation of cryptographic functions related to Diffie–Hellman and discrete logarithm problem
inferred← citeshttps://doi.org/10.1016/j.ffa.2005.05.010openalex-snapshot
Polynomial representations of the Lucas logarithm
inferred← citeshttps://doi.org/10.1016/j.ffa.2021.101864openalex-snapshot
Existence of primitive 2-normal elements in finite fields
inferred← citeshttps://doi.org/10.1016/j.ffa.2022.102053openalex-snapshot
On r-primitive k-normal elements over finite fields
inferred← citeshttps://doi.org/10.1016/j.ffa.2025.102582openalex-snapshot
F q -primitive points on varieties over finite fields
inferred← citeshttps://doi.org/10.1016/j.mcm.2006.12.017openalex-snapshot
Assessing the effectiveness of artificial neural networks on problems related to elliptic curve cryptography
inferred← citeshttps://doi.org/10.1016/j.nonrwa.2005.12.002openalex-snapshot
Studying the performance of artificial neural networks on problems related to cryptography
inferred← citeshttps://doi.org/10.1016/s1570-7954(96)80013-1openalex-snapshot
Finite Fields and Their Applications
inferred← citeshttps://doi.org/10.1080/00927872.2023.2241904openalex-snapshot
r -primitive k -normal elements in arithmetic progressions over finite fields
inferred← citeshttps://doi.org/10.1145/1140378.1140384openalex-snapshot
Transformations of two cryptographic problems in terms of matrices
inferred← citeshttps://doi.org/10.48550/arxiv.2007.11169openalex-snapshot
Existence of primitive $2$-normal elements in finite fields
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.