On the public citation graph
Modifications to the Number Field Sieve
0 signed · 84 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/bfb0091539openalex-snapshot
Factoring integers with the number field sieve
inferredcites →https://doi.org/10.1016/0022-314x(83)90002-1openalex-snapshot
On a problem of Oppenheim concerning “factorisatio numerorum”
inferredcites →https://doi.org/10.1016/0196-6774(82)90012-8openalex-snapshot
Refined analysis and improvements on some factoring algorithms
inferredcites →https://doi.org/10.1016/b978-0-12-386870-1.50014-9openalex-snapshot
Fast, Rigorous Factorization and Discrete Logarithm Algorithms
inferredcites →https://doi.org/10.1016/s1385-7258(51)50008-2openalex-snapshot
On The Number of Positive Integers ≤ x and Free of Prime Factors > y
inferredcites →https://doi.org/10.1016/s1385-7258(66)50029-4openalex-snapshot
On the number of positive integers ≤ x and free of prime factors > y, II
inferredcites →https://doi.org/10.1109/tit.1986.1057137openalex-snapshot
Solving sparse linear equations over finite fields
inferredcites →https://doi.org/10.1145/103418.103432openalex-snapshot
Factoring numbers using singular integers
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/11745853_12openalex-snapshot
An Algorithm to Solve the Discrete Logarithm Problem with the Number Field Sieve
inferred← citeshttps://doi.org/10.1007/11761679_11openalex-snapshot
VSH, an Efficient and Provable Collision-Resistant Hash Function
inferred← citeshttps://doi.org/10.1007/11957454_18openalex-snapshot
On the Security of the Tor Authentication Protocol
inferred← citeshttps://doi.org/10.1007/3-540-36178-2_1openalex-snapshot
Analysis of Bernstein’s Factorization Circuit
inferred← citeshttps://doi.org/10.1007/3-540-36178-2_23openalex-snapshot
Short Signatures in the Random Oracle Model
inferred← citeshttps://doi.org/10.1007/3-540-44495-5_25openalex-snapshot
A Generalized Takagi-Cryptosystem with a Modulus of the Form prqs
inferred← citeshttps://doi.org/10.1007/3-540-45861-1_8openalex-snapshot
Design and Analysis of Fast Provably Secure Public-Key Cryptosystems Based on a Modular Squaring
inferred← citeshttps://doi.org/10.1007/3-540-48405-1_21openalex-snapshot
Factoring N = p r q for Large r
inferred← citeshttps://doi.org/10.1007/3-540-58691-1_70openalex-snapshot
Open problems in number theoretic complexity, II
inferred← citeshttps://doi.org/10.1007/978-1-4419-5906-5_834openalex-snapshot
Number Field Sieve for the DLP
inferred← citeshttps://doi.org/10.1007/978-3-030-56880-1_2openalex-snapshot
Asymptotic Complexities of Discrete Logarithm Algorithms in Pairing-Relevant Finite Fields
inferred← citeshttps://doi.org/10.1007/978-3-319-23318-5_29openalex-snapshot
Efficient Ephemeral Elliptic Curve Cryptographic Keys
inferred← citeshttps://doi.org/10.1007/978-3-319-56620-7_7openalex-snapshot
Computation of a 768-Bit Prime Field Discrete Logarithm
inferred← citeshttps://doi.org/10.1007/978-3-319-56620-7_8openalex-snapshot
A Kilobit Hidden SNFS Discrete Logarithm Computation
inferred← citeshttps://doi.org/10.1007/978-3-319-59879-6_19openalex-snapshot
A Low-Resource Quantum Factoring Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-319-72565-9_5openalex-snapshot
Computing Discrete Logarithms in $${\mathbb F}_{{p}^{6}}$$
inferred← citeshttps://doi.org/10.1007/978-3-319-78375-8_14openalex-snapshot
The Discrete-Logarithm Problem with Preprocessing
inferred← citeshttps://doi.org/10.1007/978-3-319-97916-8_8openalex-snapshot
(Short Paper) Parameter Trade-Offs for NFS and ECM
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-45146-4_1openalex-snapshot
Factoring Large Numbers with the TWIRL Device
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-42001-6_8openalex-snapshot
An Experiment of Number Field Sieve for Discrete Logarithm Problem over GF(p 12)
inferred← citeshttps://doi.org/10.1007/978-3-642-42045-0_17openalex-snapshot
Non-uniform Cracks in the Concrete: The Power of Free Precomputation
inferred← citeshttps://doi.org/10.1007/978-3-642-57189-3_10openalex-snapshot
A Public Key Cryptosystem Based on Sparse Polynomials
inferred← citeshttps://doi.org/10.1007/978-3-662-45611-8_19openalex-snapshot
Mersenne Factorization Factory
inferred← citeshttps://doi.org/10.1007/978-3-662-46800-5_6openalex-snapshot
Improving NFS for the Discrete Logarithm Problem in Non-prime Finite Fields
inferred← citeshttps://doi.org/10.1007/978-3-662-46800-5_7openalex-snapshot
The Multiple Number Field Sieve with Conjugation and Generalized Joux-Lercier Methods
inferred← citeshttps://doi.org/10.1007/978-3-662-48797-6_7openalex-snapshot
Computing Individual Discrete Logarithms Faster in $${{\mathrm{GF}}}(p^n)$$ with the NFS-DL Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-662-48800-3_2openalex-snapshot
The Tower Number Field Sieve
inferred← citeshttps://doi.org/10.1007/978-981-10-8618-2_12openalex-snapshot
An Ultra-Secure Router-to-Router Key Exchange System
inferred← citeshttps://doi.org/10.1007/bf00123958openalex-snapshot
Computation of discrete logarithms in prime fields
inferred← citeshttps://doi.org/10.1007/bfb0015242openalex-snapshot
Algorithmic number theory and its relationship to computational complexity
inferred← citeshttps://doi.org/10.1007/bfb0091539openalex-snapshot
Factoring integers with the number field sieve
inferred← citeshttps://doi.org/10.1007/s10623-025-01788-5openalex-snapshot
On the complexity formulae of the number field sieve and its variants
inferred← citeshttps://doi.org/10.1007/s11128-024-04443-5openalex-snapshot
Quantum generalized least squares method in system identification
inferred← citeshttps://doi.org/10.1007/s11432-010-0046-4openalex-snapshot
Conjugate adjoining problem in braid groups and new design of braid-based signatures
inferred← citeshttps://doi.org/10.1007/s11460-009-0024-zopenalex-snapshot
Fast public-key encryption scheme based on Chinese remainder theorem
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.1017/cbo9781139013673openalex-snapshot
Cryptography and Secure Communication
inferred← citeshttps://doi.org/10.1017/s0004972700035048openalex-snapshot
Finding the group structure of elliptic curves over finite fields
inferred← citeshttps://doi.org/10.1090/mcom/3669openalex-snapshot
Computation of a 30750-bit binary field discrete logarithm
inferred← citeshttps://doi.org/10.1090/s0025-5718-99-01137-0openalex-snapshot
Using number fields to compute logarithms in finite fields
inferred← citeshttps://doi.org/10.1090/s0894-0347-1992-1137100-0openalex-snapshot
A Rigorous Time Bound for Factoring Integers
inferred← citeshttps://doi.org/10.1109/sfcs.1994.365702openalex-snapshot
Algorithmic number theory-the complexity contribution
inferred← citeshttps://doi.org/10.1109/tc.2009.191openalex-snapshot
Area-Time Efficient Implementation of the Elliptic Curve Method of Factoring in Reconfigurable Hardware for Application in the Number Field Sieve
inferred← citeshttps://doi.org/10.1109/tc.2017.2704082openalex-snapshot
Fast Modular Arithmetic on the Kalray MPPA-256 Processor for an Energy-Efficient Implementation of ECM
inferred← citeshttps://doi.org/10.1109/tmm.2007.902898openalex-snapshot
On the Security of “A Steganographic Scheme for Secure Communications Based on the Chaos and the Euler Theorem”
inferred← citeshttps://doi.org/10.1112/s1461157014000369openalex-snapshot
The multiple number field sieve for medium- and high-characteristic finite fields
inferred← citeshttps://doi.org/10.1112/s1461157016000164openalex-snapshot
Collecting relations for the number field sieve in
inferred← citeshttps://doi.org/10.1137/0406010openalex-snapshot
Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve
inferred← citeshttps://doi.org/10.1145/2422436.2422482openalex-snapshot
Resource-based corruptions and the combinatorics of hidden diversity
inferred← citeshttps://doi.org/10.1155/2013/818917openalex-snapshot
Noncommutative Lightweight Signcryption for Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1155/2017/1467614openalex-snapshot
A Comparative Evaluation of Algorithms in the Implementation of an Ultra-Secure Router-to-Router Key Exchange System
inferred← citeshttps://doi.org/10.1515/156939203321669546openalex-snapshot
On asymptotic complexity of computing discrete logarithms over GF(p)
inferred← citeshttps://doi.org/10.18642/jmsaa_7100121630openalex-snapshot
A STUDY OF SOME METHODS FOR FINDING SMALL ZEROS OF POLYNOMIAL CONGRUENCES APPLIED TO RSA
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.3390/sym17081212openalex-snapshot
A Unified Method for Selecting Parameters and Primitive Elements in 2 × 2 Matrix Fields for Cryptographic Protocols
inferred← citeshttps://doi.org/10.4213/dm184openalex-snapshot
Об асимптотической сложности дискретного логарифмирования в поле $\mathit{GF}(p)$
inferred← citeshttps://doi.org/10.5075/epfl-thesis-5291openalex-snapshot
On the Cryptanalysis of Public-Key Cryptography
inferred← citeshttps://doi.org/10.5075/epfl-thesis-6603openalex-snapshot
On the Analysis of Public-Key Cryptologic Algorithms
inferred← citeshttps://doi.org/10.70675/03e70022z3b51z4264z86ffz300c571650d3openalex-snapshot
Discrete Logarithm Cryptanalyses : Number Field Sieve and Lattice Tools for Side-Channel Attacks
inferred← citeshttps://doi.org/10.70675/37a7a358zfc40z4a36zb409z363eec150800openalex-snapshot
Anneaux d'endomorphismes en cryptographie
inferred← citeshttps://doi.org/10.70675/6245b0e7z0fd1z420ez8f70z854f689f7329openalex-snapshot
Symbolic Computation and Complexity Analyses for Number Theory and Cryptography
inferred← citeshttps://doi.org/10.70675/dc2bc96dz4f43z463fza85ez090235d220eeopenalex-snapshot
The Discrete Logarithm Problem in Finite Fields with Extensions
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.