On the public citation graph

New Algorithms for Finding Irreducible Polynomials Over Finite Fields

0 signed · 48 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.1002/9780470050118.ecse011openalex-snapshot
Algebraic Coding Theory
inferredcites →https://doi.org/10.1007/3-540-17179-7_15openalex-snapshot
Irreducible 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/bfb0080437openalex-snapshot
Equations over Finite Fields An Elementary Approach
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/0304-3975(87)90081-8openalex-snapshot
Factoring polynomials and primitive elements for special primes
inferredcites →https://doi.org/10.1016/s0747-7171(08)80011-9openalex-snapshot
Factoring polynomials using fewer random bits
inferredcites →https://doi.org/10.1090/s0025-5718-1985-0790658-xopenalex-snapshot
Factorization of Multivariate Polynomials Over Finite Fields
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/sfcs.1981.37openalex-snapshot
Probabilistic algorithms in finite fields
inferredcites →https://doi.org/10.1109/sfcs.1984.715897openalex-snapshot
Very Fast Parallel Matrix and Polynomial Arithmetic
inferredcites →https://doi.org/10.1109/tit.1983.1056666openalex-snapshot
Improving an algorithm for factoring polynomials over a finite field and constructing large irreducible polynomials
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.1145/28395.28444openalex-snapshot
Realistic analysis of some randomized algorithms
inferredcites →https://doi.org/10.1145/62212.62221openalex-snapshot
A time-randomness tradeoff for oblivious routing
inferredcites →https://doi.org/10.1145/62212.62242openalex-snapshot
Randomized algorithms and pseudorandom numbers
inferredcites →https://doi.org/10.1145/800204.806290openalex-snapshot
Factoring polynomials over large finite fields*

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-319-55227-9_6openalex-snapshot
On Sets of Irreducible Polynomials Closed by Composition
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-642-15155-2_42openalex-snapshot
The Multivariate Resultant Is NP-hard in Any Characteristic
inferred← citeshttps://doi.org/10.1007/s00037-007-0233-xopenalex-snapshot
Pseudorandomness and Average-Case Complexity Via Uniform Reductions
inferred← citeshttps://doi.org/10.1007/s40993-024-00594-7openalex-snapshot
Enumerating hyperelliptic curves over finite fields in quasilinear time
inferred← citeshttps://doi.org/10.1090/conm/832/16605openalex-snapshot
Multiplication in finite fields with Chudnovsky-type algorithms over the projective line
inferred← citeshttps://doi.org/10.1090/s0025-5718-00-01233-3openalex-snapshot
Using the theory of cyclotomy to factor cyclotomic polynomials over finite fields
inferred← citeshttps://doi.org/10.1090/s0025-5718-1991-1052099-2openalex-snapshot
Finding Isomorphisms Between Finite Fields
inferred← citeshttps://doi.org/10.1090/s0025-5718-1992-1106981-9openalex-snapshot
Searching for primitive roots in finite fields
inferred← citeshttps://doi.org/10.1090/s0025-5718-2011-02567-6openalex-snapshot
Constructing irreducible 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/s0273-0979-1992-00284-7openalex-snapshot
Algorithms in algebraic number theory
inferred← citeshttps://doi.org/10.1145/100216.100293openalex-snapshot
Searching for primitive roots in finite fields
inferred← citeshttps://doi.org/10.1145/2465506.2465956openalex-snapshot
Fast algorithms for l -adic towers over 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.1145/3564246.3585238openalex-snapshot
Optimal Explicit Small-Depth Formulas for the Coin Problem
inferred← citeshttps://doi.org/10.14445/22315373/ijmtt-v67i6p508openalex-snapshot
Optimal Normal Bases Over Finite Fields
inferred← citeshttps://doi.org/10.2307/3062153openalex-snapshot
Entropy Waves, the Zig-Zag Graph Product, and New Constant-Degree Expanders
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2023.57openalex-snapshot
Optimal Adjacency Labels for Subgraphs of Cartesian Products
inferred← citeshttps://doi.org/10.5167/uzh-98258openalex-snapshot
A general construction for monoid-based knapsack protocols
inferred← citeshttps://doi.org/10.54254/2753-8818/2025.22648openalex-snapshot
A Method of Finding Irreducible Polynomials
inferred← citeshttps://doi.org/10.5772/235openalex-snapshot
Convergence and Hybrid Information Technologies
inferred← citeshttps://doi.org/10.5772/9630openalex-snapshot
Systematic Generation of An Irreducible Polynomial of An Arbitrary Degree m over Fp Such That p > m
inferred← citeshttps://doi.org/10.7146/dpb.v20i358.7955openalex-snapshot
Parallel Construction of Irreducible Polynomials
inferred← citeshttps://doi.org/10.7287/peerj-cs.637v0.1/reviews/2openalex-snapshot
Peer Review #2 of "An adaptive cryptosystem on a Finite Field (v0.1)"
inferred← citeshttps://doi.org/10.7287/peerj-cs.637v0.2/reviews/1openalex-snapshot
Peer Review #1 of "An adaptive cryptosystem on a Finite Field (v0.2)"
inferred← citeshttps://doi.org/10.7287/peerj-cs.637v0.2/reviews/2openalex-snapshot
Peer Review #2 of "An adaptive cryptosystem on a Finite Field (v0.2)"
inferred← citeshttps://doi.org/10.7287/peerj-cs.637v0.2/reviews/3openalex-snapshot
Peer Review #3 of "An adaptive cryptosystem on a Finite Field (v0.2)"
inferred← citeshttps://doi.org/10.7287/peerj-cs.637v0.3/reviews/2openalex-snapshot
Peer Review #2 of "An adaptive cryptosystem on a Finite Field (v0.3)"
inferred← citeshttps://doi.org/10.7287/peerj-cs.637v0.3/reviews/3openalex-snapshot
Peer Review #3 of "An adaptive cryptosystem on a Finite Field (v0.3)"
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.