On the public citation graph
A Pipeline Architecture for Factoring Large Integers with the Quadratic Sieve Algorithm
0 signed · 60 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_17openalex-snapshot
The Quadratic Sieve Factoring Algorithm
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.1016/0304-3975(76)90050-5openalex-snapshot
Analysis of a simple factorization algorithm
inferredcites →https://doi.org/10.1090/s0025-5718-1984-0744939-5openalex-snapshot
A Monte Carlo Factoring Algorithm With Linear Storage
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.1145/357980.358017openalex-snapshot
A method for obtaining digital signatures and public-key cryptosystems
inferredcites →https://doi.org/10.1145/359340.359342openalex-snapshot
A method for obtaining digital signatures and public-key cryptosystems
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-36288-6_19openalex-snapshot
A Dedicated Sieving Hardware
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-46885-4_35openalex-snapshot
Factoring by electronic mail
inferred← citeshttps://doi.org/10.1007/3-540-48071-4_23openalex-snapshot
A Quadratic Sieve on the n-Dimensional Cube
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-1-4757-6856-5_3openalex-snapshot
Discrete Logarithms: The Past and the Future
inferred← citeshttps://doi.org/10.1007/bf00154339openalex-snapshot
Parallel implementation of the quadratic sieve
inferred← citeshttps://doi.org/10.1007/bfb0072986openalex-snapshot
Methods of factoring large integers
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/0898-1221(90)90041-hopenalex-snapshot
Some uses of microcomputers in number theory research
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.1017/cbo9781139013673openalex-snapshot
Cryptography and Secure Communication
inferred← citeshttps://doi.org/10.1023/a:1008350005447openalex-snapshot
Discrete Logarithms: The Past and the Future
inferred← citeshttps://doi.org/10.1080/09720529.2008.10698205openalex-snapshot
Algorithm for factoring some RSA and Rabin moduli
inferred← citeshttps://doi.org/10.1080/10586458.1992.10504250openalex-snapshot
Reduction of Huge, Sparse Matrices over Finite Fields Via Created Catastrophes
inferred← citeshttps://doi.org/10.1080/10586458.1996.10504592openalex-snapshot
Factoring Integers with Large-Prime Variations of the Quadratic Sieve
inferred← citeshttps://doi.org/10.1109/5.4442openalex-snapshot
The first ten years of public-key cryptography
inferred← citeshttps://doi.org/10.1109/5.4443openalex-snapshot
Cryptanalysis: a survey of recent results
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.1142/9789814623759_0022openalex-snapshot
Decomposability of Discrete Logarithm Problems
inferred← citeshttps://doi.org/10.1145/125490.125504openalex-snapshot
Massively distributed computing and factoring large integers
inferred← citeshttps://doi.org/10.14264/uql.2014.506openalex-snapshot
On the number field sieve: polynomial selection and smooth elements in number fields
inferred← citeshttps://doi.org/10.2200/s00265ed1v01y201004qmc003openalex-snapshot
Broadband Quantum Cryptography
inferred← citeshttps://doi.org/10.3233/fi-2012-626openalex-snapshot
Cryptanalysis of the Full AES Using GPU-Like Special-Purpose Hardware
inferred← citeshttps://doi.org/10.3844/jcssp.2009.674.679openalex-snapshot
Integer Factorization: Solution via Algorithm for Constrained Discrete Logarithm Problem
inferred← citeshttps://doi.org/10.3923/itj.2006.520.523openalex-snapshot
The Subset Search Algorithm: A New Attack on the Discrete Logarithm Problem over Finite Fields and Elliptic Curves
inferred← citeshttps://doi.org/10.3923/jas.2006.76.79openalex-snapshot
Improvements to Shank`s Baby-step Giant-step Algorithm
inferred← citeshttps://doi.org/10.4236/ijcns.2010.38086openalex-snapshot
Potential Vulnerability of Encrypted Messages: Decomposability of Discrete Logarithm Problems
inferred← citeshttps://doi.org/10.48550/arxiv.1004.3108openalex-snapshot
Uses of randomness in computation
inferred← citeshttps://doi.org/10.48550/arxiv.1504.02757openalex-snapshot
Modified Congruence Modulo $n$ with Half The Amount of Residues
inferred← citeshttps://doi.org/10.48550/arxiv.2005.11668openalex-snapshot
Quadratic Sieve Factorization Quantum Algorithm and its Simulation
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.