On the public citation graph
A general number field sieve implementation
0 signed · 101 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-48285-7_3openalex-snapshot
Factoring Integers Using SIMD Sieves
inferredcites →https://doi.org/10.1007/978-1-4684-4730-9_9openalex-snapshot
Factorization Using the Quadratic Sieve Algorithm
inferredcites →https://doi.org/10.1007/bfb0091539openalex-snapshot
Factoring integers with the number field sieve
inferredcites →https://doi.org/10.1007/bfb0091540openalex-snapshot
Computing a square root for the number field 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.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
inferredcites →https://doi.org/10.2307/2317055openalex-snapshot
The Art of Computer Programming. Volume 2: Seminumerical Algorithms.
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-25096-4_17openalex-snapshot
Public-Key Cryptography: An Overview of some Algorithms
inferred← citeshttps://doi.org/10.1007/10722028_4openalex-snapshot
Lattice Reduction in Cryptology: An Update
inferred← citeshttps://doi.org/10.1007/11545262_10openalex-snapshot
Scalable Hardware for Sparse Systems of Linear Equations, with Applications to Integer Factorization
inferred← citeshttps://doi.org/10.1007/11604938_18openalex-snapshot
Analysis on the Clockwise Transposition Routing for Dedicated Factoring Devices
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_16openalex-snapshot
The Function Field Sieve in the Medium Prime Case
inferred← citeshttps://doi.org/10.1007/11894063_10openalex-snapshot
Implementing the Elliptic Curve Method of Factoring in Reconfigurable Hardware
inferred← citeshttps://doi.org/10.1007/11927587_12openalex-snapshot
A Simpler Sieving Device: Combining ECM and TWIRL
inferred← citeshttps://doi.org/10.1007/3-540-45455-1_34openalex-snapshot
The Function Field Sieve Is Quite Special
inferred← citeshttps://doi.org/10.1007/3-540-46701-7_15openalex-snapshot
Improving the Exact Security of Fiat-Shamir Signature Schemes
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-48329-2_15openalex-snapshot
On the factorization of RSA-120
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-48658-5_7openalex-snapshot
Cryptographic Protocols Based on Discrete Logarithms in Real-quadratic Orders
inferred← citeshttps://doi.org/10.1007/3-540-49264-x_8openalex-snapshot
An Implementation of the General Number Field Sieve to Compute Discrete Logarithms mod p
inferred← citeshttps://doi.org/10.1007/3-540-58691-1_38openalex-snapshot
Lattice sieving and trial division
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/3-540-61581-4_70openalex-snapshot
Computing discrete logarithms with the general number field sieve
inferred← citeshttps://doi.org/10.1007/978-0-8176-8298-9_6openalex-snapshot
Modern Factorization Methods
inferred← citeshttps://doi.org/10.1007/978-1-4612-0251-6_6openalex-snapshot
Modern Factorization Methods
inferred← citeshttps://doi.org/10.1007/978-1-84628-887-6_7openalex-snapshot
Solving NP-Complete Problems with a Quantum Computer
inferred← citeshttps://doi.org/10.1007/978-3-030-39081-5_30openalex-snapshot
A Multi-factor RSA-like Scheme with Fast Decryption Based on Rédei Rational Functions over the Pell Hyperbola
inferred← citeshttps://doi.org/10.1007/978-3-030-73492-3_12openalex-snapshot
How to Factor More Effectively
inferred← citeshttps://doi.org/10.1007/978-3-0348-8295-8_11openalex-snapshot
Elliptic Curve Factorization Using a “Partially Oblivious” Function
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-29814-6_16openalex-snapshot
Strategy of Relations Collection in Factoring RSA Modulus
inferred← citeshttps://doi.org/10.1007/978-3-319-32467-8_22openalex-snapshot
Speed Records for Multi-prime RSA Using AVX2 Architectures
inferred← citeshttps://doi.org/10.1007/978-3-540-30539-2_8openalex-snapshot
Sieving Using Bucket Sort
inferred← citeshttps://doi.org/10.1007/978-3-540-40974-8_16openalex-snapshot
Estimates for Discrete Logarithm Computations in Finite Fields of Small Characteristic
inferred← citeshttps://doi.org/10.1007/978-3-540-48000-6_18openalex-snapshot
Reducing Logarithms in Totally Non-maximal Imaginary Quadratic Orders to Logarithms in Finite Fields
inferred← citeshttps://doi.org/10.1007/978-3-540-69485-4_8openalex-snapshot
Current Status of Japanese Government PKI Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-74735-2_25openalex-snapshot
CAIRN 2: An FPGA Implementation of the Sieving Step in the Number Field Sieve Method
inferred← citeshttps://doi.org/10.1007/978-3-642-13013-7_5openalex-snapshot
Implicit Factoring with Shared Most Significant and Middle Bits
inferred← citeshttps://doi.org/10.1007/978-3-642-13797-6_2openalex-snapshot
High-Performance Modular Multiplication on the Cell Processor
inferred← citeshttps://doi.org/10.1007/978-3-642-14081-5_15openalex-snapshot
Security Estimates for Quadratic Field Based Cryptosystems
inferred← citeshttps://doi.org/10.1007/978-3-642-14992-4_11openalex-snapshot
SPAKE: A Single-Party Public-Key Authenticated Key Exchange Protocol for Contact-Less Applications
inferred← citeshttps://doi.org/10.1007/978-3-642-29101-2_21openalex-snapshot
Structure-Based RSA Fault Attacks
inferred← citeshttps://doi.org/10.1007/978-3-642-32009-5_41openalex-snapshot
The Curious Case of Non-Interactive Commitments – On the Power of Black-Box vs. Non-Black-Box Use of Primitives
inferred← citeshttps://doi.org/10.1007/978-3-642-35999-6_17openalex-snapshot
Attacking (EC)DSA Given Only an Implicit Hint
inferred← citeshttps://doi.org/10.1007/978-3-642-41224-0_4openalex-snapshot
SIMD-Based Implementations of Sieving in Integer-Factoring Algorithms
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-662-44709-3_19openalex-snapshot
Cofactorization on Graphics Processing Units
inferred← citeshttps://doi.org/10.1007/978-981-10-5065-7_1openalex-snapshot
Introduction to CREST Crypto-Math Project
inferred← citeshttps://doi.org/10.1007/bfb0000440openalex-snapshot
The magic words are squeamish ossifrage
inferred← citeshttps://doi.org/10.1007/bfb0034831openalex-snapshot
Cryptographic protocols based on real-quadratic A-fields (extended abstract)
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/bfb0055738openalex-snapshot
Fast RSA-type cryptosystem modulo p k q
inferred← citeshttps://doi.org/10.1007/bfb0091540openalex-snapshot
Computing a square root for the number field sieve
inferred← citeshttps://doi.org/10.1007/s00037-012-0037-5openalex-snapshot
On reducing factorization to the discrete logarithm problem modulo a composite
inferred← citeshttps://doi.org/10.1007/s00200-017-0340-0openalex-snapshot
Factoring RSA moduli with primes sharing bits in the middle
inferred← citeshttps://doi.org/10.1007/s10710-009-9080-7openalex-snapshot
A review of procedures to evolve quantum algorithms
inferred← citeshttps://doi.org/10.1007/s12190-017-1103-6openalex-snapshot
A new generalization of the KMOV cryptosystem
inferred← citeshttps://doi.org/10.1007/s42979-026-05231-xopenalex-snapshot
Survey of Integer Factorization Using Lattice-Based Algorithms
inferred← citeshttps://doi.org/10.1016/j.amc.2016.08.019openalex-snapshot
Use of SIMD-based data parallelism to speed up sieving in integer-factoring algorithms
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.03.028openalex-snapshot
The Space Complexity Analysis in the General Number Field Sieve Integer Factorization
inferred← citeshttps://doi.org/10.1049/ip-ifs:20055018openalex-snapshot
Area–time efficient hardware architecture for factoring integers with the elliptic curve method
inferred← citeshttps://doi.org/10.1080/18824889.2023.2215691openalex-snapshot
Optimal security parameter for encrypted control systems against eavesdropper and malicious server
inferred← citeshttps://doi.org/10.1090/s0025-5718-02-01482-5openalex-snapshot
Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method
inferred← citeshttps://doi.org/10.1098/rspa.1998.0170openalex-snapshot
Bulk quantum computation with nuclear magnetic resonance: theory and experiment
inferred← citeshttps://doi.org/10.1109/dsd57027.2022.00074openalex-snapshot
Implementation of the Rainbow signature scheme on SoC FPGA
inferred← citeshttps://doi.org/10.1109/lcsys.2023.3269390openalex-snapshot
Optimal Controller and Security Parameter for Encrypted Control Systems Under Least Squares Identification
inferred← citeshttps://doi.org/10.1109/tac.2022.3174691openalex-snapshot
Designing Optimal Key Lengths and Control Laws for Encrypted Control Systems Based on Sample Identifying Complexity and Deciphering Time
inferred← citeshttps://doi.org/10.1145/1412700.1412717openalex-snapshot
Can quantum mechanics help distributed computing?
inferred← citeshttps://doi.org/10.1145/2382196.2382206openalex-snapshot
A cross-protocol attack on the TLS protocol
inferred← citeshttps://doi.org/10.1145/3087604.3087606openalex-snapshot
Parametrizations for Families of ECM-Friendly Curves
inferred← citeshttps://doi.org/10.1145/3274856.3274857openalex-snapshot
James Bond's Most Secret Weapon
inferred← citeshttps://doi.org/10.1145/367701.367709openalex-snapshot
An introduction to quantum computing for non-physicists
inferred← citeshttps://doi.org/10.13021/mars/4655openalex-snapshot
Number Field Sieve: Pseudocodes and Software Implementation
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.1515/jmc-2016-0046openalex-snapshot
RSA: A number of formulas to improve the search for p+qp+q
inferred← citeshttps://doi.org/10.1515/jmc-2024-0036openalex-snapshot
First-degree prime ideals of composite extensions
inferred← citeshttps://doi.org/10.15276/eltecs.30.106.2019.21openalex-snapshot
ANALYSIS OF THE FACTORIZATION METHOD BASED ON ELLIPTIC CURVES THEORY
inferred← citeshttps://doi.org/10.20868/upm.thesis.193openalex-snapshot
Números primos especiales y sus aplicaciones criptográficas
inferred← citeshttps://doi.org/10.2139/ssrn.5001459openalex-snapshot
Applications of the Domain of Prime Pairs to the Factorization of Large Numbers
inferred← citeshttps://doi.org/10.22028/d291-25895openalex-snapshot
On the computation of discrete logarithms in finite prime fields
inferred← citeshttps://doi.org/10.23919/indiacom54597.2022.9763232openalex-snapshot
Robustness of Zero-Knowledge Proofs using RSA Problem
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.5121/ijitmc.2013.1301openalex-snapshot
Factoring Cryptosystem Moduli when the Co-Factors Difference is Bounded
inferred← citeshttps://doi.org/10.5860/choice.34-4512openalex-snapshot
Handbook of applied cryptography
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.