On the public citation graph
Factoring integers with the number field sieve
0 signed · 207 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-12868-9_108openalex-snapshot
Factoring polynomials over algebraic number fields
inferredcites →https://doi.org/10.1007/bf00198464openalex-snapshot
Modifications to the Number Field Sieve
inferredcites →https://doi.org/10.1007/bf01457454openalex-snapshot
Factoring polynomials with rational coefficients
inferredcites →https://doi.org/10.1007/bfb0091540openalex-snapshot
Computing a square root for the number field sieve
inferredcites →https://doi.org/10.1016/0012-365x(92)90540-vopenalex-snapshot
On the number of fixed point free elements in a permutation group
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/b978-0-12-386870-1.50014-9openalex-snapshot
Fast, Rigorous Factorization and Discrete Logarithm Algorithms
inferredcites →https://doi.org/10.1080/00927879308824728openalex-snapshot
The proportion of fixed-point-free elements of a transitive permutation group
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/pspum/024/0332694openalex-snapshot
The large sieve and probabilistic Galois theory
inferredcites →https://doi.org/10.1090/s0025-5718-1975-0371800-5openalex-snapshot
A method of factoring and the factorization of 𝐹₇
inferredcites →https://doi.org/10.1090/s0025-5718-1976-0568283-xopenalex-snapshot
Factoring Multivariate Polynomials over Algebraic Number Fields
inferredcites →https://doi.org/10.1090/s0025-5718-1980-0583523-xopenalex-snapshot
Table errata: “A method of factoring and the factorization of 𝐹₇” [Math. Comp. 29 (1975), 183–205; MR 51 #8017] by M. A. Morrison and J. Brillhart
inferredcites →https://doi.org/10.1090/s0025-5718-1981-0595059-1openalex-snapshot
Asymptotically Fast Factorization of Integers
inferredcites →https://doi.org/10.1090/s0025-5718-1990-1023756-8openalex-snapshot
Explicit Bounds for Primality Testing and Related Problems
inferredcites →https://doi.org/10.1090/s0025-5718-1991-1068808-2openalex-snapshot
Generation of Elements with Small Modular Squares and Provably Fast Integer Factoring Algorithms
inferredcites →https://doi.org/10.1090/s0025-5718-1993-1182953-4openalex-snapshot
The Factorization of the Ninth Fermat Number
inferredcites →https://doi.org/10.1090/s0273-0979-1992-00284-7openalex-snapshot
Algorithms in algebraic number theory
inferredcites →https://doi.org/10.1090/s0894-0347-1992-1137100-0openalex-snapshot
A Rigorous Time Bound for Factoring Integers
inferredcites →https://doi.org/10.1109/tit.1986.1057137openalex-snapshot
Solving sparse linear equations over finite fields
inferredcites →https://doi.org/10.1137/0214015openalex-snapshot
Factoring Polynomials over Algebraic Number Fields
inferredcites →https://doi.org/10.1137/0406010openalex-snapshot
Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve
inferredcites →https://doi.org/10.1145/103418.103432openalex-snapshot
Factoring numbers using singular integers
inferredcites →https://doi.org/10.1145/355705.355709openalex-snapshot
Factoring Polynomials Over Algebraic Number Fields
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.
inferredcites →https://doi.org/10.4153/cjm-1981-080-0openalex-snapshot
On an Irreducibility Theorem of A. Cohn
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4777785openalex-extracted
Cryptoanalysis of Rsa Variants with Special Structure of Rsa Primes
inferred← citeshttps://doi.org/10.1002/cpe.5641openalex-snapshot
A privacy‐preserving density peak clustering algorithm in cloud computing
inferred← citeshttps://doi.org/10.1006/inco.1998.2761openalex-snapshot
Function Field Sieve Method for Discrete Logarithms over Finite Fields
inferred← citeshttps://doi.org/10.1007/10722028_11openalex-snapshot
Strategies in Filtering in the Number Field Sieve
inferred← citeshttps://doi.org/10.1007/11599555_65openalex-snapshot
Integer Factorization by a Parallel GNFS Algorithm for Public Key Cryptosystems
inferred← citeshttps://doi.org/10.1007/11802167_13openalex-snapshot
A Parallel GNFS Algorithm Based on a Reliable Look-Ahead Block Lanczos Method for Integer Factorization
inferred← citeshttps://doi.org/10.1007/11839569_41openalex-snapshot
A Parallel GNFS Algorithm with the Biorthogonal Block Lanczos Method for Integer Factorization
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-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/3-540-48329-2_14openalex-snapshot
An implementation of the general number field sieve
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-48969-x_4openalex-snapshot
Emerging Standards for Public-Key Cryptography
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-49264-x_9openalex-snapshot
A Block Lanczos Algorithm for Finding Dependencies over GF(2)
inferred← citeshttps://doi.org/10.1007/3-540-56686-4_38openalex-snapshot
Fixed-parameter complexity and cryptography
inferred← citeshttps://doi.org/10.1007/3-540-61581-4_45openalex-snapshot
A multiple polynomial general number field sieve
inferred← citeshttps://doi.org/10.1007/3-540-61581-4_66openalex-snapshot
Discrete logarithms: The effectiveness of the index calculus method
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/3-540-69053-0_19openalex-snapshot
Stronger Security Proofs for RSA and Rabin Bits
inferred← citeshttps://doi.org/10.1007/978-0-8176-8298-9_5openalex-snapshot
Classical Methods of Factorization
inferred← citeshttps://doi.org/10.1007/978-0-8176-8298-9_6openalex-snapshot
Modern Factorization Methods
inferred← citeshttps://doi.org/10.1007/978-1-4419-5906-5_465openalex-snapshot
Number Field Sieve for Factoring
inferred← citeshttps://doi.org/10.1007/978-1-4612-0251-6_5openalex-snapshot
Classical Methods of Factorization
inferred← citeshttps://doi.org/10.1007/978-1-4612-0251-6_6openalex-snapshot
Modern Factorization Methods
inferred← citeshttps://doi.org/10.1007/978-3-030-36178-5_40openalex-snapshot
A Study on the Performance of Base-m Polynomial Selection Algorithm Using GPU
inferred← citeshttps://doi.org/10.1007/978-3-030-51938-4_19openalex-snapshot
Attacking RSA Using an Arbitrary Parameter
inferred← citeshttps://doi.org/10.1007/978-3-030-56880-1_3openalex-snapshot
Comparing the Difficulty of Factorization and Discrete Logarithm: A 240-Digit Experiment
inferred← citeshttps://doi.org/10.1007/978-3-030-71522-9_465openalex-snapshot
Number Field Sieve for Factoring
inferred← citeshttps://doi.org/10.1007/978-3-031-01718-6openalex-snapshot
Quantum Computing for Computer Architects
inferred← citeshttps://doi.org/10.1007/978-3-031-44207-0_11openalex-snapshot
Discrete Denoising Diffusion Approach to Integer Factorization
inferred← citeshttps://doi.org/10.1007/978-3-031-50432-7_11openalex-snapshot
Wie man eine Zahl faktorisiert
inferred← citeshttps://doi.org/10.1007/978-3-031-68388-6_3openalex-snapshot
Limits on the Power of Prime-Order Groups: Separating Q-Type from Static Assumptions
inferred← citeshttps://doi.org/10.1007/978-3-031-90200-0_1openalex-snapshot
Hybrid Quantum Computing: The Use Case of Shor’s Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-032-13301-4_1openalex-snapshot
On the Classical Hardness of the Semidirect Discrete Logarithm Problem in Finite Groups
inferred← citeshttps://doi.org/10.1007/978-3-0348-9078-6_34openalex-snapshot
The Role of Smooth Numbers in Number Theoretic Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-16295-9_8openalex-snapshot
RSA and Elliptic Curve Least Significant Bit Security
inferred← citeshttps://doi.org/10.1007/978-3-319-56620-7_2openalex-snapshot
Short Generators Without Quantum Computers: The Case of Multiquadratics
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-59879-6_19openalex-snapshot
A Low-Resource Quantum Factoring Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-319-98402-5_5openalex-snapshot
Time-Multiplexed Methods for Optical Quantum Information Processing
inferred← citeshttps://doi.org/10.1007/978-3-540-40061-5_19openalex-snapshot
On Class Group Computations Using the Number Field Sieve
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-540-76900-2_2openalex-snapshot
When e-th Roots Become Easier Than Factoring
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-31662-3_15openalex-snapshot
Square Root Algorithms for the Number Field Sieve
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-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-59932-3_1openalex-snapshot
Sieving Methods for Class Group Computation
inferred← citeshttps://doi.org/10.1007/978-3-662-46800-5_21openalex-snapshot
(Batch) Fully Homomorphic Encryption over Integers for Non-Binary Message Spaces
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-3-662-49301-4_6openalex-snapshot
Post-Quantum Cryptography: State of the Art
inferred← citeshttps://doi.org/10.1007/978-93-86279-46-0_1openalex-snapshot
Analysis of the Lattice Sieve
inferred← citeshttps://doi.org/10.1007/978-981-99-8730-6_5openalex-snapshot
We are on the Same Side. Alternative Sieving Strategies for the Number Field Sieve
inferred← citeshttps://doi.org/10.1007/bf00198464openalex-snapshot
Modifications to the Number Field Sieve
inferred← citeshttps://doi.org/10.1007/bf02760932openalex-snapshot
Bounds for fixed point free elements in a transitive group and applications to curves over finite fields
inferred← citeshttps://doi.org/10.1007/bfb0034831openalex-snapshot
Cryptographic protocols based on real-quadratic A-fields (extended abstract)
inferred← citeshttps://doi.org/10.1007/bfb0054125openalex-snapshot
Computing discrete logarithms with quadratic number rings
inferred← citeshttps://doi.org/10.1007/bfb0054134openalex-snapshot
A cryptosystem based on non-maximal imaginary quadratic orders with fast decryption
inferred← citeshttps://doi.org/10.1007/bfb0054856openalex-snapshot
Bounding smooth integers (extended abstract)
inferred← citeshttps://doi.org/10.1007/bfb0054858openalex-snapshot
Modelling the yield of number field sieve polynomials
inferred← citeshttps://doi.org/10.1007/bfb0054859openalex-snapshot
A Montgomery-like square root for the Number Field Sieve
inferred← citeshttps://doi.org/10.1007/bfb0091540openalex-snapshot
Computing a square root for the number field sieve
inferred← citeshttps://doi.org/10.1007/bfb0091541openalex-snapshot
A general number field sieve implementation
inferred← citeshttps://doi.org/10.1007/s00145-010-9057-yopenalex-snapshot
An L(1/3) Discrete Logarithm Algorithm for Low Degree Curves
inferred← citeshttps://doi.org/10.1007/s00145-018-9280-5openalex-snapshot
Updating Key Size Estimations for Pairings
inferred← citeshttps://doi.org/10.1007/s001459910008openalex-snapshot
Stronger Security Proofs for RSA and Rabin Bits
inferred← citeshttps://doi.org/10.1007/s10115-013-0632-zopenalex-snapshot
A lightweight privacy preserving SMS-based recommendation system for mobile users
inferred← citeshttps://doi.org/10.1007/s10440-006-9045-2openalex-snapshot
A Review on the Isomorphism Classes of Hyperelliptic Curves of Genus 2 over Finite Fields Admitting a Weierstrass Point
inferred← citeshttps://doi.org/10.1007/s10623-024-01435-5openalex-snapshot
Finding orientations of supersingular elliptic curves and quaternion orders
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/s10801-008-0135-2openalex-snapshot
On fixed points of permutations
inferred← citeshttps://doi.org/10.1007/s11227-025-07555-6openalex-snapshot
Industrial progress with quantum algorithms: an in-depth review
inferred← citeshttps://doi.org/10.1007/s11432-015-5331-9openalex-snapshot
On the coefficients of the polynomial in the number field sieve
inferred← citeshttps://doi.org/10.1007/s40993-022-00402-0openalex-snapshot
Fast norm computation in smooth-degree Abelian number fields
inferred← citeshttps://doi.org/10.1007/s42484-022-00072-2openalex-snapshot
Using Shor’s algorithm on near term Quantum computers: a reduced version
inferred← citeshttps://doi.org/10.1016/bs.host.2020.10.001openalex-snapshot
Blockchain technology: Theory and practice
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.camwa.2010.01.020openalex-snapshot
An integrated parallel GNFS algorithm for integer factorization based on Linbox Montgomery block Lanczos method over GF(2)
inferred← citeshttps://doi.org/10.1016/j.cjph.2021.05.001openalex-snapshot
Quantum computation: Algorithms and Applications
inferred← citeshttps://doi.org/10.1016/j.egypro.2011.11.264openalex-snapshot
Lattice Sieve Architecture based on Different Calculation Platforms
inferred← citeshttps://doi.org/10.1016/j.jnt.2009.11.003openalex-snapshot
Computing the endomorphism ring of an ordinary elliptic curve over a finite field
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.1016/j.jnt.2019.01.013openalex-snapshot
Computing the endomorphism ring of an ordinary abelian surface over a finite field
inferred← citeshttps://doi.org/10.1016/j.jsc.2018.06.007openalex-snapshot
Automating algorithm selection: Checking for matrix properties that can simplify computations
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.07.017openalex-snapshot
Resource bounded symmetry of information revisited
inferred← citeshttps://doi.org/10.1016/s0167-9236(98)00057-8openalex-snapshot
Anonymous mechanisms in group decision support systems communication
inferred← citeshttps://doi.org/10.1017/9781139049801.013openalex-snapshot
The impact of the number field sieve on the discrete logarithm problem in finite fields
inferred← citeshttps://doi.org/10.1023/a:1015250102792openalex-snapshot
The expected number of random elements to generate a finite abelian group
inferred← citeshttps://doi.org/10.1038/npjqi.2015.23openalex-snapshot
Quantum algorithms: an overview
inferred← citeshttps://doi.org/10.1038/s41598-020-71654-yopenalex-snapshot
On speeding up factoring with quantum SAT solvers
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.10504590openalex-snapshot
An Implementation of the Number Field Sieve
inferred← citeshttps://doi.org/10.1090/bull/1648openalex-snapshot
New applications of the polynomial method: The cap set conjecture and beyond
inferred← citeshttps://doi.org/10.1090/conm/789/15840openalex-snapshot
Mathematical etudes on quantum computation
inferred← citeshttps://doi.org/10.1090/mcom/2954openalex-snapshot
Computing algebraic numbers of bounded height
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.1090/s0025-5718-09-02198-xopenalex-snapshot
The number field sieve for integers of low weight
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.1090/s0273-0979-1992-00284-7openalex-snapshot
Algorithms in algebraic number theory
inferred← citeshttps://doi.org/10.1090/s0894-0347-1992-1137100-0openalex-snapshot
A Rigorous Time Bound for Factoring Integers
inferred← citeshttps://doi.org/10.1098/rsta.1993.0139openalex-snapshot
Discrete logarithms and local units
inferred← citeshttps://doi.org/10.1103/revmodphys.82.1openalex-snapshot
Quantum algorithms for algebraic problems
inferred← citeshttps://doi.org/10.1109/access.2024.3362955openalex-snapshot
Quantum Computing: Circuits, Algorithms, and Applications
inferred← citeshttps://doi.org/10.1109/cis.2013.103openalex-snapshot
The Improvement of the Commonly Used Linear Polynomial Selection Methods
inferred← citeshttps://doi.org/10.1109/cis.2013.104openalex-snapshot
An Improved Block Lanczos Algorithm to Solve Large and Sparse Matrixes on GPUs
inferred← citeshttps://doi.org/10.1109/ieeestd.2000.92292openalex-snapshot
IEEE Standard Specifications for Public-Key Cryptography
inferred← citeshttps://doi.org/10.1109/jiot.2024.3410702openalex-snapshot
Cybersecurity in Critical Infrastructures: A Post-Quantum Cryptography Perspective
inferred← citeshttps://doi.org/10.1109/micro.2005.9openalex-snapshot
A Quantum Logic Array Microarchitecture: Scalable Quantum Data Movement and Computation
inferred← citeshttps://doi.org/10.1109/mis.2022.3168973openalex-snapshot
Deep Learning Architectures for Approximating Goldbach’s Function in New Regions
inferred← citeshttps://doi.org/10.1109/wescon.1995.485416openalex-snapshot
Security estimates for 512-bit RSA
inferred← citeshttps://doi.org/10.1109/wi.2018.00-46openalex-snapshot
Goldbach's Function Approximation Using Deep Learning
inferred← citeshttps://doi.org/10.1112/plms.70091openalex-snapshot
Derangements in non‐Frobenius groups
inferred← citeshttps://doi.org/10.1112/s1461157000001340openalex-snapshot
On the Computation of Integral Closures of Cyclic Extensions of Function Fields
inferred← citeshttps://doi.org/10.1137/0406010openalex-snapshot
Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve
inferred← citeshttps://doi.org/10.1145/1005285.1005305openalex-snapshot
Reliable Krylov-based algorithms for matrix null space and rank
inferred← citeshttps://doi.org/10.1145/1330521.1330522openalex-snapshot
High-level interconnect model for the quantum logic array architecture
inferred← citeshttps://doi.org/10.1145/1837934.1837989openalex-snapshot
Yet another block Lanczos algorithm
inferred← citeshttps://doi.org/10.1145/3563219openalex-snapshot
No Free Lunch Theorem for Security and Utility in Federated Learning
inferred← citeshttps://doi.org/10.1145/3644523.3644633openalex-snapshot
A provable secure group key management scheme based on the Chinese remainder theorem and Pohlig-Hellman Exponential Cipher
inferred← citeshttps://doi.org/10.1145/860854.860882openalex-snapshot
Early termination over small fields
inferred← citeshttps://doi.org/10.11575/prism/30296openalex-snapshot
Spam, Phishing, and the Looming Challenge of Big Botnets
inferred← citeshttps://doi.org/10.11606/d.45.2011.tde-14032012-213011openalex-snapshot
Segurança do bit menos significativo no RSA e em curvas elípticas
inferred← citeshttps://doi.org/10.13021/mars/4655openalex-snapshot
Number Field Sieve: Pseudocodes and Software Implementation
inferred← citeshttps://doi.org/10.14569/ijacsa.2014.050727openalex-snapshot
A parallel line sieve for the GNFS Algorithm
inferred← citeshttps://doi.org/10.1504/ijbic.2010.032127openalex-snapshot
Application of bio-inspired algorithm to the problem of integer factorisation
inferred← citeshttps://doi.org/10.1515/jmc-2024-0036openalex-snapshot
First-degree prime ideals of composite extensions
inferred← citeshttps://doi.org/10.1515/jmc.2007.007openalex-snapshot
Optimal Parameterization of SNFS
inferred← citeshttps://doi.org/10.1587/transfun.e93.a.872openalex-snapshot
Changes to Quantum Cryptography
inferred← citeshttps://doi.org/10.20868/upm.thesis.193openalex-snapshot
Números primos especiales y sus aplicaciones criptográficas
inferred← citeshttps://doi.org/10.2140/obs.2019.2.103openalex-snapshot
Fast multiquadratic S-unit computation and application to the calculation of class groups
inferred← citeshttps://doi.org/10.2140/obs.2019.2.275openalex-snapshot
Higher-dimensional sieving for the number field sieve algorithms
inferred← citeshttps://doi.org/10.2200/s00066ed1v01y200610cac001openalex-snapshot
Quantum Computing for Computer Architects
inferred← citeshttps://doi.org/10.22331/q-2021-04-15-433openalex-snapshot
How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits
inferred← citeshttps://doi.org/10.25911/5d6272199e44dopenalex-snapshot
Polynomial selection for the number field sieve integer factorisation algorithm
inferred← citeshttps://doi.org/10.30684/etj.30.4.5openalex-snapshot
Impact of decreasing polynomial degree in time needed to factor a 100 digits integer by General Number field sieve algorithm
inferred← citeshttps://doi.org/10.30707/etd2024.20240618063947766023.999996openalex-snapshot
Factorization in Cybersecurity: a Dual Role of Defense and Vulnerability in the Age of Quantum Computing
inferred← citeshttps://doi.org/10.3103/s0027132214010045openalex-snapshot
Solution of polynomial equations in the field of algebraic numbers
inferred← citeshttps://doi.org/10.3390/cryptography10040057openalex-snapshot
Dynamic Scaling Pollard’s P-1 Algorithm
inferred← citeshttps://doi.org/10.3390/jcp1040033openalex-snapshot
New Semi-Prime Factorization and Application in Large RSA Key Attacks
inferred← citeshttps://doi.org/10.3390/math8091433openalex-snapshot
First-Degree Prime Ideals of Biquadratic Fields Dividing Prescribed Principal Ideals
inferred← citeshttps://doi.org/10.3390/sym18081291openalex-snapshot
Geometric Structures from Bézout Decompositions of Semiprimes
inferred← citeshttps://doi.org/10.35950/cbej.v18i73.9197openalex-snapshot
Modification AES with Permutation from DES
inferred← citeshttps://doi.org/10.37394/23206.2022.21.7openalex-snapshot
The Investigation of Euler’s Totient Function Preimages for φ(n)=2^mp1^αp2^β and the Cardinality of Pre-totients in General Case
inferred← citeshttps://doi.org/10.37394/23209.2022.19.3openalex-snapshot
Optimal Method of Integer Factorization
inferred← citeshttps://doi.org/10.4007/annals.2012.175.3.10openalex-snapshot
On sharp transitions in making squares
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amr.466-467.298openalex-snapshot
Calculation Components Analysis of the Lattice Sieve
inferred← citeshttps://doi.org/10.4153/s0008414x25000136openalex-snapshot
Multiplicative structure of shifted multiplicative subgroups and its applications to Diophantine tuples
inferred← citeshttps://doi.org/10.4236/ijcns.2011.410073openalex-snapshot
Integer Factorization of Semi-Primes Based on Analysis of a Sequence of Modular Elliptic Equations
inferred← citeshttps://doi.org/10.48550/arxiv.2007.02730openalex-snapshot
Refined Analysis of the Asymptotic Complexity of the Number Field Sieve
inferred← citeshttps://doi.org/10.5753/sbseg.2012.20540openalex-snapshot
Segurança do bit menos significativo no RSA e em curvas elípticas
inferred← citeshttps://doi.org/10.5802/jtnb.113openalex-snapshot
Approximatting rings of integers in number fields
inferred← citeshttps://doi.org/10.70675/6245b0e7z0fd1z420ez8f70z854f689f7329openalex-snapshot
Symbolic Computation and Complexity Analyses for Number Theory and Cryptography
inferred← citeshttps://doi.org/10.70675/7d269863z0331z407ez828azdef6ea1bd1a8openalex-snapshot
Analysis and design of post-quantum cryptographic algorithms : PKP-based signature scheme and ultra-short multivariate signatures
inferred← citeshttps://doi.org/10.70675/dc2bc96dz4f43z463fza85ez090235d220eeopenalex-snapshot
The Discrete Logarithm Problem in Finite Fields with Extensions
inferred← citeshttps://doi.org/10.7498/aps.73.20231414openalex-snapshot
Effects of quantum noise on Shor’s algorithm
inferred← citeshttps://doi.org/10.7840/kics.2012.37a.12.1031openalex-snapshot
Square and Cube Root Algorithms in Finite Field and Their Applications
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.