On the public citation graph

Factoring Polynomials over Special Finite Fields

0 signed · 34 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/cpa.3160080302openalex-snapshot
The orders of the linear groups
inferredcites →https://doi.org/10.1006/jagm.1995.1036openalex-snapshot
Counting the Integers Factorable via Cyclotomic Methods
inferredcites →https://doi.org/10.1007/10722028openalex-snapshot
Algorithmic Number Theory
inferredcites →https://doi.org/10.1007/3-540-58691-1_58openalex-snapshot
Factorization of polynomials over finite fields in subexponential time under GRH
inferredcites →https://doi.org/10.1007/3-540-61581-4openalex-snapshot
Algorithmic Number Theory
inferredcites →https://doi.org/10.1007/bf02124680openalex-snapshot
Factoring polynomials modulo special primes
inferredcites →https://doi.org/10.1016/0196-6774(91)90014-popenalex-snapshot
Generalized riemann hypothesis 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.1090/s0025-5718-1970-0276200-xopenalex-snapshot
Factoring polynomials over large finite fields
inferredcites →https://doi.org/10.1090/s0025-5718-1985-0777280-6openalex-snapshot
Elliptic curves over finite fields and the computation of square roots mod 𝑝
inferredcites →https://doi.org/10.1090/s0025-5718-1989-0947467-1openalex-snapshot
Factoring with cyclotomic polynomials
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.1090/s0273-0979-1992-00284-7openalex-snapshot
Algorithms in algebraic number theory
inferredcites →https://doi.org/10.1137/s0097539796302749openalex-snapshot
The Relationship Between Breaking the Diffie--Hellman Protocol and Computing Discrete Logarithms
inferredcites →https://doi.org/10.1145/12130.12166openalex-snapshot
Finding irreducible polynomials over finite fields
inferredcites →https://doi.org/10.1201/9780429493638openalex-snapshot
Introduction To Commutative Algebra
inferredcites →https://doi.org/10.2307/2316241openalex-snapshot
Introduction to Commutative Algebra.

What points at this work

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

inferred← citeshttps://doi.org/10.1006/jsco.1999.1001openalex-snapshot
On the Deterministic Complexity of Factoring Polynomials
inferred← citeshttps://doi.org/10.1006/jsco.1999.1002openalex-snapshot
Factoring Polynomials Over Finite Fields: A Survey
inferred← citeshttps://doi.org/10.1007/978-3-030-01560-2_10openalex-snapshot
Cryptanalysis of 4-Bit Crypto S-Boxes in Smart Applications
inferred← citeshttps://doi.org/10.1007/978-3-540-24633-6_8openalex-snapshot
What Do Random Polynomials over Finite Fields Look Like?
inferred← citeshttps://doi.org/10.1007/978-3-540-76900-2_26openalex-snapshot
Black-Box Extension Fields and the Inexistence of Field-Homomorphic One-Way Permutations
inferred← citeshttps://doi.org/10.1090/s0025-5718-2010-02377-4openalex-snapshot
Using partial smoothness of 𝑝-1 for factoring polynomials modulo 𝑝
inferred← citeshttps://doi.org/10.1090/s0025-5718-2011-02505-6openalex-snapshot
Trading GRH for algebra: Algorithms for factoring polynomials and related structures
inferred← citeshttps://doi.org/10.1112/s1461157013000296openalex-snapshot
Deterministic polynomial factoring and association schemes
inferred← citeshttps://doi.org/10.1145/1073884.1073932openalex-snapshot
Deterministic equation solving over finite fields
inferred← citeshttps://doi.org/10.1145/1576702.1576730openalex-snapshot
Schemes for deterministic polynomial factoring
inferred← citeshttps://doi.org/10.1145/3087604.3087620openalex-snapshot
Irreducibility and Deterministic r-th Root Finding over Finite Fields
inferred← citeshttps://doi.org/10.1201/b15006-22openalex-snapshot
Cryptography
inferred← citeshttps://doi.org/10.22215/etd/2015-10627openalex-snapshot
Deterministic Factorization of Polynomials over Finite Fields
inferred← citeshttps://doi.org/10.3233/978-1-60750-019-3-115openalex-snapshot
Divisibility, Smoothness and Cryptographic Applications
inferred← citeshttps://doi.org/10.3233/fi-2013-858openalex-snapshot
Algorithms for Relatively Cyclotomic Primes
inferred← citeshttps://doi.org/10.4236/ojdm.2018.81003openalex-snapshot
Search for Monic Irreducible Polynomials with Decimal Equivalents of Polynomials over Galois Field GF(pq)
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.