On the public citation graph

A short proof for explicit formulas for discrete logarithms in finite fields

https://doi.org/10.1007/bf01810847
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-39757-4_20openalex-snapshot
Discrete logarithms in finite fields and their cryptographic significance
inferredcites →https://doi.org/10.1007/bf01840433openalex-snapshot
Discrete logarithms inGF(p)
inferredcites →https://doi.org/10.1017/cbo9781139172769openalex-snapshot
Introduction to Finite Fields and their Applications
inferredcites →https://doi.org/10.1109/18.21214openalex-snapshot
A knapsack-type public key cryptosystem based on arithmetic in finite fields
inferredcites →https://doi.org/10.1109/tit.1984.1056986openalex-snapshot
A polynomial form for logarithms modulo a prime (Corresp.)
inferredcites →https://doi.org/10.1137/0213053openalex-snapshot
How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
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.1006/ffta.2001.0334openalex-snapshot
Incomplete Character Sums and Polynomial Interpolation of the Discrete Logarithm
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-1-4757-2226-0_6openalex-snapshot
The Discrete Logarithm Problem
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/bf01189026openalex-snapshot
A note on discrete logarithms in finite fields
inferred← citeshttps://doi.org/10.1007/s00200-002-0104-2openalex-snapshot
A Polynomial Representation of the Diffie-Hellman Mapping
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.disc.2007.09.012openalex-snapshot
A shorter proof for an explicit formula for discrete logarithms in finite fields
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.2007.12.003openalex-snapshot
Closed formulae for the Weil pairing inversion
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.1017/cbo9781139696456.002openalex-snapshot
Some highlights of Harald Niederreiter's work
inferred← citeshttps://doi.org/10.1023/a:1021819602497openalex-snapshot
inferred← citeshttps://doi.org/10.1080/0020739x.2010.510215openalex-snapshot
Construction of logarithm tables for Galois Fields
inferred← citeshttps://doi.org/10.1112/s1461157000001224openalex-snapshot
On Polynomial Interpolations related to Verheul Homomorphisms
inferred← citeshttps://doi.org/10.1201/b15006-22openalex-snapshot
Cryptography
inferred← citeshttps://doi.org/10.4134/jkms.2015.52.1.209openalex-snapshot
POLYNOMIAL REPRESENTATIONS FOR n-TH ROOTS IN FINITE FIELDS
inferred← citeshttps://doi.org/10.4995/thesis/10251/17027openalex-snapshot
Constructing Covering Arrays using Parallel Computing and Grid Computing
inferred← citeshttps://doi.org/10.5772/35326openalex-snapshot
Construction of Orthogonal Arrays of Index Unity Using Logarithm Tables for Galois 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.