On the public citation graph
Factoring with Two Large Primes
0 signed · 43 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-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/bfb0023840openalex-snapshot
Massively parallel computing and factoring
inferredcites →https://doi.org/10.1007/bfb0091534openalex-snapshot
The development of the number field sieve
inferredcites →https://doi.org/10.1007/bfb0091541openalex-snapshot
A general number field sieve implementation
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-1987-0866102-2openalex-snapshot
Implementation of a New Primality Test
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-1182953-4openalex-snapshot
The Factorization of the Ninth Fermat Number
inferredcites →https://doi.org/10.1137/0216026openalex-snapshot
A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph
inferredcites →https://doi.org/10.1145/362619.362628openalex-snapshot
An algorithm for the blocks and cutnodes of a graph
inferredcites →https://doi.org/10.1145/363219.363232openalex-snapshot
An algorithm for finding a fundamental set of cycles of a graph
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-44750-4_30openalex-snapshot
NFS with Four Large Primes: An Explosive Experiment
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-45455-1_35openalex-snapshot
MPQS with Three Large Primes
inferred← citeshttps://doi.org/10.1007/3-540-45682-1_7openalex-snapshot
Computation of Discrete Logarithms in $$ \mathbb{F}_{2^{607} } $$
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-48329-2_15openalex-snapshot
On the factorization of RSA-120
inferred← citeshttps://doi.org/10.1007/3-540-61581-4_43openalex-snapshot
On the reduction of composed relations from the number field sieve
inferred← citeshttps://doi.org/10.1007/978-3-540-79456-1_1openalex-snapshot
Running Time Predictions for Factoring Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-57189-3_4openalex-snapshot
Discrete Logarithms: Recent Progress
inferred← citeshttps://doi.org/10.1007/bfb0000440openalex-snapshot
The magic words are squeamish ossifrage
inferred← citeshttps://doi.org/10.1007/bfb0034863openalex-snapshot
A World Wide Number Field Sieve factoring record: On to 512 bits
inferred← citeshttps://doi.org/10.1007/bfb0091539openalex-snapshot
Factoring integers with the number field sieve
inferred← citeshttps://doi.org/10.1007/bfb0091541openalex-snapshot
A general number field sieve implementation
inferred← citeshttps://doi.org/10.1016/j.ffa.2005.05.001openalex-snapshot
Algebraic curves and cryptography
inferred← citeshttps://doi.org/10.1016/j.jnt.2017.10.019openalex-snapshot
Rigorous analysis of a randomised number field sieve
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.1090/s0025-5718-06-01900-4openalex-snapshot
A double large prime variation for small genus hyperelliptic index calculus
inferred← citeshttps://doi.org/10.1090/s0025-5718-1993-1182953-4openalex-snapshot
The Factorization of the Ninth Fermat Number
inferred← citeshttps://doi.org/10.1142/9789812388841_0005openalex-snapshot
COMPUTATIONAL METHODS IN PUBLIC KEY CRYPTOLOGY
inferred← citeshttps://doi.org/10.1179/136821904225011564openalex-snapshot
Asymmetric image watermarking based on reversible chaotic maps
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.22028/d291-25895openalex-snapshot
On the computation of discrete logarithms in finite prime fields
inferred← citeshttps://doi.org/10.25911/5d6272199e44dopenalex-snapshot
Polynomial selection for the number field sieve integer factorisation algorithm
inferred← citeshttps://doi.org/10.31428/10317/787openalex-snapshot
Diseño, implementación y optimización de algoritmos criptográficos de generación de aleatorios y factorización de enteros
inferred← citeshttps://doi.org/10.3923/jas.2006.458.481openalex-snapshot
Review of Methods for Integer Factorization Applied to Cryptography
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.