On the public citation graph

Searching for Primitive Roots in Finite Fields

0 signed · 46 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/978-1-4613-1983-2_7openalex-snapshot
Factoring Polynomials over Finite Fields
inferredcites →https://doi.org/10.1007/bf01390234openalex-snapshot
A bound for the least prime ideal in the Chebotarev Density Theorem
inferredcites →https://doi.org/10.1007/bf01547799openalex-snapshot
Character sums and primitive roots in algebraic number fields
inferredcites →https://doi.org/10.1007/bf02124680openalex-snapshot
Factoring polynomials modulo special primes
inferredcites →https://doi.org/10.1007/bf02843959openalex-snapshot
Character sums and primitive roots in finite fields
inferredcites →https://doi.org/10.1007/bfb0060851openalex-snapshot
Topics in Multiplicative Number Theory
inferredcites →https://doi.org/10.1016/0020-0190(90)90195-4openalex-snapshot
On the deterministic complexity of factoring polynomials over finite fields
inferredcites →https://doi.org/10.1016/0020-0190(91)90212-zopenalex-snapshot
Smoothness and factoring polynomials over finite fields
inferredcites →https://doi.org/10.1016/0304-3975(87)90081-8openalex-snapshot
Factoring polynomials and primitive elements for special primes
inferredcites →https://doi.org/10.1070/sm1992v071n01abeh001389openalex-snapshot
ON PRIMITIVE ELEMENTS IN FINITE FIELDS AND ON ELLIPTIC CURVES
inferredcites →https://doi.org/10.1090/s0002-9904-1942-07767-6openalex-snapshot
On the least primitive root of a prime
inferredcites →https://doi.org/10.1090/s0025-5718-1990-0993933-0openalex-snapshot
New algorithms for finding irreducible polynomials over finite fields
inferredcites →https://doi.org/10.1090/s0025-5718-1991-1052099-2openalex-snapshot
Finding Isomorphisms Between Finite Fields
inferredcites →https://doi.org/10.1093/oso/9780199219858.001.0001openalex-snapshot
An Introduction To The Theory Of Numbers
inferredcites →https://doi.org/10.1093/qmath/4.1.4openalex-snapshot
DISTRIBUTION OF PRIMITIVE ROOTS IN A FINITE FIELD
inferredcites →https://doi.org/10.1093/qmath/os-8.1.308openalex-snapshot
ON PRIMITIVE ROOTS IN FINITE FIELDS
inferredcites →https://doi.org/10.1109/sfcs.1989.63462openalex-snapshot
Galois groups and factoring polynomials over finite fields
inferredcites →https://doi.org/10.1112/plms/s3-17.1.11openalex-snapshot
Character Sums and Primitive Roots in Finite Fields
inferredcites →https://doi.org/10.1112/s0025579300005027openalex-snapshot
A note on primitive roots in finite fields
inferredcites →https://doi.org/10.1145/12130.12166openalex-snapshot
Finding irreducible polynomials over finite fields
inferredcites →https://doi.org/10.1145/22145.22159openalex-snapshot
Riemann hypothesis and finding roots over finite fields
inferredcites →https://doi.org/10.2307/1969420openalex-snapshot
The Least Quadratic Non Residue
inferredcites →https://doi.org/10.4064/aa-19-1-1-30openalex-snapshot
On the error term in the linear sieve

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-540-69499-1_6openalex-snapshot
Efficient Finite Fields in the Maxima Computer Algebra System
inferred← citeshttps://doi.org/10.1007/978-3-540-85912-3_6openalex-snapshot
On the Average Distribution of Power Residues and Primitive Elements in Inversive and Nonlinear Recurring Sequences
inferred← citeshttps://doi.org/10.1007/s00145-009-9047-0openalex-snapshot
Discrete Logarithm Problems with Auxiliary Inputs
inferred← citeshttps://doi.org/10.1090/conm/632/12630openalex-snapshot
Finding primitive elements in finite fields of small characteristic
inferred← citeshttps://doi.org/10.1090/mcom/4003openalex-snapshot
Computation of the least primitive root
inferred← citeshttps://doi.org/10.1090/psapm/048/1314886openalex-snapshot
Explicit bounds for primes in residue classes
inferred← citeshttps://doi.org/10.1090/s0002-9939-99-04795-4openalex-snapshot
Elements of provable high orders in finite 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-1994-1257578-3openalex-snapshot
Primitive Normal Polynomials Over Finite Fields
inferred← citeshttps://doi.org/10.1090/s0025-5718-96-00751-xopenalex-snapshot
Constructing nonresidues in finite fields and the extended Riemann hypothesis
inferred← citeshttps://doi.org/10.1090/s0025-5718-96-00763-6openalex-snapshot
Explicit bounds for primes in residue classes
inferred← citeshttps://doi.org/10.1090/s0025-5718-97-00835-1openalex-snapshot
Generators and irreducible polynomials over finite fields
inferred← citeshttps://doi.org/10.1090/s0025-5718-97-00890-9openalex-snapshot
Comments on search procedures for primitive roots
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.1145/2518131openalex-snapshot
From Low-Distortion Norm Embeddings to Explicit Uncertainty Relations and Efficient Information Locking
inferred← citeshttps://doi.org/10.1515/9783110298161openalex-snapshot
Integers
inferred← citeshttps://doi.org/10.26421/qic22.9-10-4openalex-snapshot
An exact quantum hidden subgroup algorithm and applications to solvable groups
inferred← citeshttps://doi.org/10.4036/iis.2013.129openalex-snapshot
NP-Complete Sets for Computing Discrete Logarithms and Integer Factorization
inferred← citeshttps://doi.org/10.4064/aa111-3-6openalex-snapshot
Multiplicative character sums for nonlinear recurring sequences
inferred← citeshttps://doi.org/10.4064/cm96-2-4openalex-snapshot
Products of factorials modulo p
inferred← citeshttps://doi.org/10.4213/dm184openalex-snapshot
Об асимптотической сложности дискретного логарифмирования в поле $\mathit{GF}(p)$
inferred← citeshttps://doi.org/10.53846/goediss-4538openalex-snapshot
On Artin's primitive root conjecture
inferred← citeshttps://doi.org/10.5802/jtnb.880openalex-snapshot
Elements of large order on varieties over prime 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.