On the public citation graph
Incomplete character sums over finite fields and their application to the interpolation of the discrete logarithm by Boolean functions
0 signed · 20 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/978-3-0348-8664-2openalex-snapshot
Number theoretic methods in cryptography : complexity lower bounds
inferredcites →https://doi.org/10.1007/978-3-662-07998-0openalex-snapshot
Introduction to coding theory
inferredcites →https://doi.org/10.1007/bf02843959openalex-snapshot
Character sums and primitive roots in finite fields
inferredcites →https://doi.org/10.1007/s001450010002openalex-snapshot
On Polynomial Approximation of the Discrete Logarithm and the Diffie—Hellman Mapping
inferredcites →https://doi.org/10.1007/s006050050004openalex-snapshot
On the Multidimensional Distribution of Inversive Congruential Pseudorandom Numbers in Parts of the Period
inferredcites →https://doi.org/10.1090/s0025-5718-00-01273-4openalex-snapshot
On the distribution of inversive congruential pseudorandom numbers in parts of the period
inferredcites →https://doi.org/10.4064/aa-92-1-89-98openalex-snapshot
Exponential sums and the distribution of inversive congruential pseudorandom numbers with prime-power modulus
inferredcites →https://doi.org/10.4064/aa-93-4-387-399openalex-snapshot
Incomplete exponential sums over finite fields and their applications to new inversive pseudorandom number generators
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_11openalex-snapshot
On the Non-linearity and Sparsity of Boolean Functions Related to the Discrete Logarithm in Finite Fields of Characteristic Two
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-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-30615-0_9openalex-snapshot
Boolean Functions Derived from Pseudorandom Binary Sequences
inferred← citeshttps://doi.org/10.1007/s12095-011-0043-5openalex-snapshot
Boolean functions derived from Fermat quotients
inferred← citeshttps://doi.org/10.1016/j.disc.2008.01.056openalex-snapshot
Measures of pseudorandomness for binary sequences constructed using 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/s0166-218x(02)00445-6openalex-snapshot
Interpolation of the discrete logarithm in Fq by Boolean functions and by polynomials in several variables modulo a divisor of q−1
inferred← citeshttps://doi.org/10.1016/s1571-0653(04)00202-1openalex-snapshot
Interpolation of the Discrete Logarithm in Finite Fields by Boolean Functions
inferred← citeshttps://doi.org/10.1023/a:1022584306676openalex-snapshot
Linear Complexity of the Discrete Logarithm
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.