On the public citation graph
Massively parallel computing and factoring
0 signed · 26 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/3-540-38424-3_8openalex-snapshot
Solving Large Sparse Linear Systems Over Finite Fields
inferredcites →https://doi.org/10.1007/3-540-46416-6_43openalex-snapshot
Non-interactive Public-Key Cryptography
inferredcites →https://doi.org/10.1007/3-540-46877-3_7openalex-snapshot
Factoring with two large primes
inferredcites →https://doi.org/10.1007/3-540-46885-4_35openalex-snapshot
Factoring by electronic mail
inferredcites →https://doi.org/10.1007/3-540-47555-9_16openalex-snapshot
Massively parallel elliptic curve factoring
inferredcites →https://doi.org/10.1016/b978-0-444-88071-0.50017-5openalex-snapshot
Algorithms in Number Theory
inferredcites →https://doi.org/10.1080/10586458.1992.10504250openalex-snapshot
Reduction of Huge, Sparse Matrices over Finite Fields Via Created Catastrophes
inferredcites →https://doi.org/10.1090/conm/022openalex-snapshot
Factorizations of 𝑏ⁿ±1, 𝑏=2, 3, 5, 6, 7, 10, 11, 12 Up to High Powers
inferredcites →https://doi.org/10.1090/s0025-5718-1985-0777282-xopenalex-snapshot
Modular Multiplication Without Trial Division
inferredcites →https://doi.org/10.1090/s0025-5718-1987-0866113-7openalex-snapshot
Speeding the Pollard and Elliptic Curve Methods of Factorization
inferredcites →https://doi.org/10.1090/s0025-5718-1987-0866119-8openalex-snapshot
The Multiple Polynomial Quadratic Sieve
inferredcites →https://doi.org/10.1090/s0025-5718-1993-1122078-7openalex-snapshot
A Practical Analysis of the Elliptic Curve Factoring Algorithm
inferredcites →https://doi.org/10.1090/s0025-5718-1993-1182953-4openalex-snapshot
The Factorization of the Ninth Fermat Number
inferredcites →https://doi.org/10.2307/1971363openalex-snapshot
Factoring Integers with Elliptic Curves
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-48285-7_3openalex-snapshot
Factoring Integers Using SIMD Sieves
inferred← citeshttps://doi.org/10.1007/3-540-48329-2_15openalex-snapshot
On the factorization of RSA-120
inferred← citeshttps://doi.org/10.1007/bfb0000440openalex-snapshot
The magic words are squeamish ossifrage
inferred← citeshttps://doi.org/10.1090/s0025-5718-1994-1250773-9openalex-snapshot
Factoring with two large primes
inferred← citeshttps://doi.org/10.1109/asap.2011.6043261openalex-snapshot
On the performance of GPU public-key cryptography
inferred← citeshttps://doi.org/10.1109/cisis.2009.109openalex-snapshot
Distributed Parallel Groebner Bases Computation
inferred← citeshttps://doi.org/10.1109/cisis.2010.26openalex-snapshot
Distributed Hybrid Gröbner Bases Computation
inferred← citeshttps://doi.org/10.48550/arxiv.1008.0011openalex-snapshot
Parallel and distributed Gröbner bases computation in JAS
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.