On the public citation graph
Parallel implementation of the quadratic sieve
0 signed · 44 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-39757-4_18openalex-snapshot
Status Report on Factoring (At the Sandia National Laboratories)
inferredcites →https://doi.org/10.1007/978-1-4684-4730-9_9openalex-snapshot
Factorization Using the Quadratic Sieve Algorithm
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-1975-0371800-5openalex-snapshot
A method of factoring and the factorization of 𝐹₇
inferredcites →https://doi.org/10.1090/s0025-5718-1987-0866119-8openalex-snapshot
The Multiple Polynomial Quadratic Sieve
inferredcites →https://doi.org/10.1109/tit.1986.1057137openalex-snapshot
Solving sparse linear equations over finite fields
inferredcites →https://doi.org/10.1112/blms/16.6.632openalex-snapshot
COMPUTATIONAL METHODS IN NUMBER THEORY
inferredcites →https://doi.org/10.1137/0217023openalex-snapshot
A Pipeline Architecture for Factoring Large Integers with the Quadratic Sieve Algorithm
inferredcites →https://doi.org/10.2307/2008069openalex-snapshot
Factorizations of b n ± 1, b = 2, 3, 5, 6, 7, 10, 11, 12 up to High Powers.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/0-387-34805-0_57openalex-snapshot
Covert Distributed Processing with Computer Viruses
inferred← citeshttps://doi.org/10.1007/3-540-38424-3_40openalex-snapshot
A Comparison of Practical Public-Key Cryptosystems based on Integer Factorization and Discrete Logarithms
inferred← citeshttps://doi.org/10.1007/3-540-44968-x_2openalex-snapshot
Recent Progress and Prospects for Integer Factorisation Algorithms
inferred← citeshttps://doi.org/10.1007/3-540-46877-3_10openalex-snapshot
Distributed Primality Proving and the Primality of (23539 + 1)/3
inferred← citeshttps://doi.org/10.1007/3-540-46885-4_35openalex-snapshot
Factoring by electronic mail
inferred← citeshttps://doi.org/10.1007/3-540-47721-7_36openalex-snapshot
Thomas — A Complete Single Chip RSA Device
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-48311-x_1openalex-snapshot
Some Parallel Algorithms for Integer Factorisation
inferred← citeshttps://doi.org/10.1007/3-540-52921-7_68openalex-snapshot
Distributed algorithms for deciphering
inferred← citeshttps://doi.org/10.1007/3-540-53065-7_161openalex-snapshot
Achieving superlinear speedups for the multiple polynomial quadratic sieve factoring algorithm on a distributed memory multiprocessor
inferred← citeshttps://doi.org/10.1007/978-3-642-34931-7_3openalex-snapshot
Using the Cloud to Determine Key Strengths
inferred← citeshttps://doi.org/10.1007/978-3-642-78502-3_27openalex-snapshot
Number Theory and Cryptography
inferred← citeshttps://doi.org/10.1007/978-981-15-0978-0_13openalex-snapshot
A Symmetrical Encryption Technique for Text Encryption Using Randomized Matrix Based Key Generation
inferred← citeshttps://doi.org/10.1007/bfb0013895openalex-snapshot
Breaking the traditional computer security research barriers
inferred← citeshttps://doi.org/10.1016/0377-0427(89)90370-1openalex-snapshot
Factoring with the quadratic sieve on large vector computers
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50017-5openalex-snapshot
Algorithms in Number Theory
inferred← citeshttps://doi.org/10.1016/b978-0-444-88621-7.50018-9openalex-snapshot
Factoring with the quadratic sieve on large vector computers
inferred← citeshttps://doi.org/10.1016/s0378-4754(99)00053-1openalex-snapshot
Towards high-performance symbolic computing: using MuPAD as a problem solving environment
inferred← citeshttps://doi.org/10.1090/s0025-5718-1988-0917832-6openalex-snapshot
Tables of Fibonacci and Lucas Factorizations
inferred← citeshttps://doi.org/10.1090/s0025-5718-1993-1122078-7openalex-snapshot
A Practical Analysis of the Elliptic Curve Factoring Algorithm
inferred← citeshttps://doi.org/10.1109/2.116847openalex-snapshot
Chinese lotto as an exhaustive code-breaking machine
inferred← citeshttps://doi.org/10.1109/49.17708openalex-snapshot
Algorithm engineering for public key algorithms
inferred← citeshttps://doi.org/10.1109/dmcc.1990.555392openalex-snapshot
The Quadratic Sieve Factoring Algorithm on Distributed Memory Multiprocessors
inferred← citeshttps://doi.org/10.1142/9789812388841_0005openalex-snapshot
COMPUTATIONAL METHODS IN PUBLIC KEY CRYPTOLOGY
inferred← citeshttps://doi.org/10.48550/arxiv.1004.3108openalex-snapshot
Uses of randomness in computation
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.