On the public citation graph

Modelling the yield of number field sieve polynomials

https://doi.org/10.1007/bfb0054858
0 signed · 21 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.1007/3-540-58691-1_38openalex-snapshot
Lattice sieving and trial division
inferredcites →https://doi.org/10.1007/3-540-61581-4_45openalex-snapshot
A multiple polynomial general number field sieve
inferredcites →https://doi.org/10.1007/bfb0091539openalex-snapshot
Factoring integers with the number field sieve
inferredcites →https://doi.org/10.1016/0304-3975(76)90050-5openalex-snapshot
Analysis of a simple factorization algorithm
inferredcites →https://doi.org/10.1080/10586458.1996.10504590openalex-snapshot
An Implementation of the Number Field Sieve
inferredcites →https://doi.org/10.1090/s0025-5718-96-00763-6openalex-snapshot
Explicit bounds for primes in residue classes
inferredcites →https://doi.org/10.1090/s0025-5718-96-00775-2openalex-snapshot
Asymptotic semismoothness probabilities

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-44968-x_2openalex-snapshot
Recent Progress and Prospects for Integer Factorisation Algorithms
inferred← citeshttps://doi.org/10.1007/3-540-45539-6_1openalex-snapshot
Factorization of a 512-Bit RSA Modulus
inferred← citeshttps://doi.org/10.1007/3-540-48311-x_1openalex-snapshot
Some Parallel Algorithms for Integer Factorisation
inferred← citeshttps://doi.org/10.1007/978-3-540-40061-5_4openalex-snapshot
Factoring Estimates for a 1024-Bit RSA Modulus
inferred← citeshttps://doi.org/10.1007/978-3-540-48000-6_16openalex-snapshot
Factorization of RSA-140 Using the Number Field Sieve
inferred← citeshttps://doi.org/10.1007/978-3-642-14623-7_18openalex-snapshot
Factorization of a 768-Bit RSA Modulus
inferred← citeshttps://doi.org/10.1007/b72231openalex-snapshot
Advances in Cryptology - ASIACRYPT’99
inferred← citeshttps://doi.org/10.1007/s00145-018-9280-5openalex-snapshot
Updating Key Size Estimations for Pairings
inferred← citeshttps://doi.org/10.1090/mcom3048openalex-snapshot
Better polynomials for GNFS
inferred← citeshttps://doi.org/10.1090/s0025-5718-06-01870-9openalex-snapshot
On polynomial selection for the general number field sieve
inferred← citeshttps://doi.org/10.1090/s0025-5718-2015-02926-3openalex-snapshot
Root optimization of polynomials in the number field sieve
inferred← citeshttps://doi.org/10.25911/5d6272199e44dopenalex-snapshot
Polynomial selection for the number field sieve integer factorisation algorithm
inferred← citeshttps://doi.org/10.3390/math8091433openalex-snapshot
First-Degree Prime Ideals of Biquadratic Fields Dividing Prescribed Principal Ideals
inferred← citeshttps://doi.org/10.70675/6245b0e7z0fd1z420ez8f70z854f689f7329openalex-snapshot
Symbolic Computation and Complexity Analyses for Number Theory and 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.