On the public citation graph

Factoring polynomials modulo special primes

0 signed · 38 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.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-1977-0422193-8openalex-snapshot
On the Efficiency of Algorithms for Polynomial Factoring
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-60-99239-5openalex-snapshot
Mathematics of Computation
inferredcites →https://doi.org/10.1109/sfcs.1977.18openalex-snapshot
On taking roots in finite fields
inferredcites →https://doi.org/10.1109/sfcs.1987.25openalex-snapshot
Factoring polynomials over finite fields
inferredcites →https://doi.org/10.1142/9407openalex-snapshot
Algebraic Coding Theory
inferredcites →https://doi.org/10.1145/22145.22159openalex-snapshot
Riemann hypothesis and finding roots over 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.1006/ffta.2000.0306openalex-snapshot
Factoring Polynomials over Special Finite Fields
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-1-4757-2226-0_2openalex-snapshot
Factoring Polynomials over Finite Fields
inferred← citeshttps://doi.org/10.1007/s00200-015-0280-5openalex-snapshot
Deterministic root finding over finite fields using Graeffe transforms
inferred← citeshttps://doi.org/10.1016/0020-0190(91)90212-zopenalex-snapshot
Smoothness and factoring polynomials over finite fields
inferred← citeshttps://doi.org/10.1016/j.ipl.2004.09.015openalex-snapshot
Optimal strong primes
inferred← citeshttps://doi.org/10.1016/j.jsc.2019.02.011openalex-snapshot
Deterministic polynomial factoring over finite fields: A uniform approach via P -schemes
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)80001-1openalex-snapshot
Univariate polynomial factorization over finite fields
inferred← citeshttps://doi.org/10.1070/rm1991v046n01abeh002725openalex-snapshot
On some problems in the theory of 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-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.1109/18.567667openalex-snapshot
Factoring polynomials using binary representations of finite fields
inferred← citeshttps://doi.org/10.1109/sfcs.1989.63462openalex-snapshot
Galois groups and factoring polynomials over finite fields
inferred← citeshttps://doi.org/10.1112/s1461157013000296openalex-snapshot
Deterministic polynomial factoring and association schemes
inferred← citeshttps://doi.org/10.1137/0221018openalex-snapshot
Subgroup Refinement Algorithms for Root Finding in $GF(q)$
inferred← citeshttps://doi.org/10.1137/0405026openalex-snapshot
Galois Groups and Factoring Polynomials over Finite Fields
inferred← citeshttps://doi.org/10.1145/100216.100293openalex-snapshot
Searching for primitive roots in finite fields
inferred← citeshttps://doi.org/10.1145/1576702.1576730openalex-snapshot
Schemes for deterministic polynomial factoring
inferred← citeshttps://doi.org/10.1145/2755996.2756647openalex-snapshot
Randomized Root Finding over Finite FFT-fields using Tangent Graeffe Transforms
inferred← citeshttps://doi.org/10.1201/b15006-22openalex-snapshot
Cryptography
inferred← citeshttps://doi.org/10.20868/upm.thesis.193openalex-snapshot
Números primos especiales y sus aplicaciones criptográficas
inferred← citeshttps://doi.org/10.22215/etd/2015-10627openalex-snapshot
Deterministic Factorization of Polynomials over Finite Fields
inferred← citeshttps://doi.org/10.2307/2153041openalex-snapshot
Searching for Primitive Roots in 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.48550/arxiv.0803.0471openalex-snapshot
Using the smoothness of p-1 for computing roots modulo p
inferred← citeshttps://doi.org/10.48550/arxiv.0811.3165openalex-snapshot
Trading GRH for algebra: algorithms for factoring polynomials and related structures
inferred← citeshttps://doi.org/10.48550/arxiv.1406.3672openalex-snapshot
Deterministic polynomial factoring under the assumption of the Extended Riemann Hypothesis (ERH)
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.