On the public citation graph
A monte carlo method for factorization
0 signed · 359 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.1017/s0305004100049252openalex-snapshot
Theorems on factorization and primality testing
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.1145/360980.361001openalex-snapshot
A design for a number theory package with an optimized trial division routine
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpe.8365openalex-snapshot
A Novel Approach to Integer Factorization: A Paradigm in Cryptography
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_38openalex-snapshot
A Note on Shanks’s Chains of Primes
inferred← citeshttps://doi.org/10.1007/11586821_26openalex-snapshot
Pairings on Elliptic Curves over Finite Commutative Rings
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-10843-2_1openalex-snapshot
Refined analysis and improvements on some factoring algorithms
inferred← citeshttps://doi.org/10.1007/3-540-39757-4_3openalex-snapshot
Algebraical Structures of Cryptographic Transformations
inferred← citeshttps://doi.org/10.1007/3-540-39805-8_10openalex-snapshot
Is the Data Encryption Standard a Group? (Preliminary Abstract)
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_37openalex-snapshot
Factoring N = pq 2 with the Elliptic Curve Method
inferred← citeshttps://doi.org/10.1007/3-540-45624-4_23openalex-snapshot
Maximal Periods of x2 + c in Fq
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-46885-4_35openalex-snapshot
Factoring by electronic mail
inferred← citeshttps://doi.org/10.1007/3-540-47719-5_9openalex-snapshot
First Implementation of Cryptographic Protocols Based on Algebraic Number Fields
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-68697-5_18openalex-snapshot
Improving Implementable Meet-in-the-Middle Attacks by Orders of Magnitude
inferred← citeshttps://doi.org/10.1007/88-470-0477-2_5openalex-snapshot
Il Problema della Fattorizzazione
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-7722-9_2openalex-snapshot
Quantum Attacks on IFP-Based Cryptosystems
inferred← citeshttps://doi.org/10.1007/978-1-4419-7722-9_3openalex-snapshot
Quantum Attacks on DLP-Based Cryptosystems
inferred← citeshttps://doi.org/10.1007/978-1-4419-7722-9_4openalex-snapshot
Quantum Attacks on ECDLP-Based Cryptosystems
inferred← citeshttps://doi.org/10.1007/978-1-4612-4544-5_5openalex-snapshot
Factorization Techniques from Fermat to Today
inferred← citeshttps://doi.org/10.1007/978-3-030-03326-2_2openalex-snapshot
Practical Attacks Against the Walnut Digital Signature Scheme
inferred← citeshttps://doi.org/10.1007/978-3-030-03807-6_1openalex-snapshot
Provable Time-Memory Trade-Offs: Symmetric Cryptography Against Memory-Bounded Adversaries
inferred← citeshttps://doi.org/10.1007/978-3-030-17653-2_16openalex-snapshot
Tight Time-Memory Trade-Offs for Symmetric Encryption
inferred← citeshttps://doi.org/10.1007/978-3-030-19066-8_4openalex-snapshot
Shor’s Algorithm for Integer Factorization
inferred← citeshttps://doi.org/10.1007/978-3-030-24268-8_19openalex-snapshot
A Review of the Factorization Problem of Large Integers
inferred← citeshttps://doi.org/10.1007/978-3-030-45388-6_18openalex-snapshot
Improved Classical Cryptanalysis of SIKE in Practice
inferred← citeshttps://doi.org/10.1007/978-3-030-45724-2_15openalex-snapshot
On the Streaming Indistinguishability of a Random Permutation and a Random Function
inferred← citeshttps://doi.org/10.1007/978-3-030-45727-3_15openalex-snapshot
Non-interactive Zero-Knowledge in Pairing-Free Groups from Weaker Assumptions
inferred← citeshttps://doi.org/10.1007/978-3-030-45727-3_4openalex-snapshot
Low Weight Discrete Logarithm and Subset Sum in $$2^{0.65n}$$ with Polynomial Memory
inferred← citeshttps://doi.org/10.1007/978-3-030-53929-0_14openalex-snapshot
A Secure Variant of the Fiat and Shamir Authentication Protocol Using Gaussian Integers
inferred← citeshttps://doi.org/10.1007/978-3-030-56784-2_5openalex-snapshot
The Memory-Tightness of Authenticated Encryption
inferred← citeshttps://doi.org/10.1007/978-3-030-81293-5_7openalex-snapshot
Quantum Key Search for Ternary LWE
inferred← citeshttps://doi.org/10.1007/978-3-031-17433-9_4openalex-snapshot
Identity-Based Encryption in DDH Hard Groups
inferred← citeshttps://doi.org/10.1007/978-3-031-19439-9_2openalex-snapshot
Cryptography: Confidentiality
inferred← citeshttps://doi.org/10.1007/978-3-031-22105-7_19openalex-snapshot
A Quantum Version of Pollard’s Rho of Which Shor’s Algorithm is a Particular Case
inferred← citeshttps://doi.org/10.1007/978-3-031-30545-0_3openalex-snapshot
Fine-Grained Non-interactive Key-Exchange: Constructions and Lower Bounds
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-63814-5_3openalex-snapshot
Prime Numbers: Euclid and Eratosthenes
inferred← citeshttps://doi.org/10.1007/978-3-031-68379-4_9openalex-snapshot
Fine-Grained Non-interactive Key Exchange, Revisited
inferred← citeshttps://doi.org/10.1007/978-3-031-68391-6_5openalex-snapshot
CryptAttackTester: high-assurance attack analysis
inferred← citeshttps://doi.org/10.1007/978-3-032-01878-6_13openalex-snapshot
Reducing the Number of Qubits in Quantum Factoring
inferred← citeshttps://doi.org/10.1007/978-3-032-13301-4_11openalex-snapshot
Beyond Sequential Walks: Parallelizing the GA-Dlog Problem
inferred← citeshttps://doi.org/10.1007/978-3-032-27574-5_21openalex-snapshot
Constructing a Parameterized Polynomial Map Through Functional Graphs and Applications
inferred← citeshttps://doi.org/10.1007/978-3-032-35412-9_11openalex-snapshot
On the Regularity of the Generalized Birthday Problem
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-0348-8968-1_28openalex-snapshot
Arithmétique et Cryptographie
inferred← citeshttps://doi.org/10.1007/978-3-319-10683-0_2openalex-snapshot
The Past, Evolving Present, and Future of the Discrete Logarithm
inferred← citeshttps://doi.org/10.1007/978-3-319-10683-0_6openalex-snapshot
Open Problems for Polynomials over Finite Fields and Applications
inferred← citeshttps://doi.org/10.1007/978-3-319-13051-4_22openalex-snapshot
Solving the Discrete Logarithm of a 113-Bit Koblitz Curve with an FPGA Cluster
inferred← citeshttps://doi.org/10.1007/978-3-319-16277-5_2openalex-snapshot
Accelerating Iterative SpMV for the Discrete Logarithm Problem Using GPUs
inferred← citeshttps://doi.org/10.1007/978-3-319-25823-2_3openalex-snapshot
Quantum Algorithms for Integer Factorization
inferred← citeshttps://doi.org/10.1007/978-3-319-25823-2_4openalex-snapshot
Quantum Computing for Discrete Logarithms
inferred← citeshttps://doi.org/10.1007/978-3-319-31515-7_4openalex-snapshot
Elliptic Curve Cryptosystems
inferred← citeshttps://doi.org/10.1007/978-3-319-32085-4_16openalex-snapshot
Flaws in the Application of Number Theory in Key Distribution Schemes for Multicast Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-70697-9_8openalex-snapshot
An Efficient Quantum Collision Search Algorithm and Implications on Symmetric Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-319-72536-9_5openalex-snapshot
Factoring Based Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-319-72536-9_6openalex-snapshot
Logarithm Based Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-319-78381-9_4openalex-snapshot
Fiat-Shamir and Correlation Intractability from Strong KDM-Secure Encryption
inferred← citeshttps://doi.org/10.1007/978-3-319-94821-8_22openalex-snapshot
Proof Pearl: Constructive Extraction of Cycle Finding Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-540-30576-7_4openalex-snapshot
Cryptography in Subgroups of $\mathbb{Z}_{n}^{*}$
inferred← citeshttps://doi.org/10.1007/978-3-540-46588-1_11openalex-snapshot
Short Proofs of Knowledge for Factoring
inferred← citeshttps://doi.org/10.1007/978-3-540-71039-4_28openalex-snapshot
New Techniques for Cryptanalysis of Hash Functions and Improved Attacks on Snefru
inferred← citeshttps://doi.org/10.1007/978-3-540-77366-5_14openalex-snapshot
Hidden Identity-Based Signatures
inferred← citeshttps://doi.org/10.1007/978-3-540-79456-1_27openalex-snapshot
A Birthday Paradox for Markov Chains, with an Optimal Bound for Collision in the Pollard Rho Algorithm for Discrete Logarithm
inferred← citeshttps://doi.org/10.1007/978-3-540-88733-1_14openalex-snapshot
On the Equivalence of Generic Group Models
inferred← citeshttps://doi.org/10.1007/978-3-642-02384-2_7openalex-snapshot
Cryptanalysis of RSA Using the Ratio of the Primes
inferred← citeshttps://doi.org/10.1007/978-3-642-23141-4_15openalex-snapshot
A Detrministic Factorization and Primality Testing Algorithm for Integers of the Form Z Mod 6 = -1
inferred← citeshttps://doi.org/10.1007/978-3-642-24861-0_25openalex-snapshot
Efficient Fail-Stop Signatures from the Factoring Assumption
inferred← citeshttps://doi.org/10.1007/978-3-642-28365-9_27openalex-snapshot
Constructing Cluster of Simple FPGA Boards for Cryptologic Computations
inferred← citeshttps://doi.org/10.1007/978-3-642-28926-2_61openalex-snapshot
Prime Factorization without Using Any Approximations
inferred← citeshttps://doi.org/10.1007/978-3-642-33481-8_14openalex-snapshot
Random Mappings with Restricted Preimages
inferred← citeshttps://doi.org/10.1007/978-3-642-41383-4_8openalex-snapshot
Improvement of Faugère et al.’s Method to Solve ECDLP
inferred← citeshttps://doi.org/10.1007/978-3-642-59663-6_7openalex-snapshot
Number Theory and Cryptography (using Maple)
inferred← citeshttps://doi.org/10.1007/978-3-642-70865-7_4openalex-snapshot
Authenticity, Anonymity and Security in Osis
inferred← citeshttps://doi.org/10.1007/978-3-662-07981-2_11openalex-snapshot
Legendre Polynomial over Finite Fields and Factorization of Integers
inferred← citeshttps://doi.org/10.1007/978-3-662-43933-3_11openalex-snapshot
Time-Memory Trade-Offs for Near-Collisions
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-3-662-48324-4_8openalex-snapshot
Accelerating Homomorphic Evaluation on Reconfigurable Hardware
inferred← citeshttps://doi.org/10.1007/978-3-662-53008-5_1openalex-snapshot
Adversary-Dependent Lossy Trapdoor Function from Hardness of Factoring Semi-smooth RSA Subgroup Moduli
inferred← citeshttps://doi.org/10.1007/978-4-431-55060-0_3openalex-snapshot
Introduction to Public-Key Cryptography
inferred← citeshttps://doi.org/10.1007/978-981-19-0920-7openalex-snapshot
Modern Cryptography Volume 1
inferred← citeshttps://doi.org/10.1007/978-981-96-0668-9_15openalex-snapshot
Bridging Algorithmic Foundations with Information Security and Privacy: Set-k-Multicover Problem and Homomorphic Secret Sharing
inferred← citeshttps://doi.org/10.1007/978-981-96-0888-1_15openalex-snapshot
Revisiting Pairing-Friendly Curves with Embedding Degrees 10 and 14
inferred← citeshttps://doi.org/10.1007/978-981-97-5028-3_2openalex-snapshot
Automatic Quantum Multi-collision Distinguishers and Rebound Attacks with Triangulation Algorithm
inferred← citeshttps://doi.org/10.1007/bf00128046openalex-snapshot
Factoring: Algorithms, computations, and computers
inferred← citeshttps://doi.org/10.1007/bf00206323openalex-snapshot
Is the Data Encryption Standard a group? (Results of cycling experiments on DES)
inferred← citeshttps://doi.org/10.1007/bf01874396openalex-snapshot
Randomized algorithms: An annotated bibliography
inferred← citeshttps://doi.org/10.1007/bf01931269openalex-snapshot
Some remarks concerning the M.I.T. public-key cryptosystem
inferred← citeshttps://doi.org/10.1007/bf01931273openalex-snapshot
On not storing the path of a random walk
inferred← citeshttps://doi.org/10.1007/bf01933190openalex-snapshot
An improved Monte Carlo factorization algorithm
inferred← citeshttps://doi.org/10.1007/bf02253297openalex-snapshot
Modifikationen des Pollard-Algorithmus
inferred← citeshttps://doi.org/10.1007/bfb0024472openalex-snapshot
On using Carmichael numbers for public key encryption systems
inferred← citeshttps://doi.org/10.1007/bfb0028487openalex-snapshot
On weak RSA-keys produced from pretty good privacy
inferred← citeshttps://doi.org/10.1007/bfb0036466openalex-snapshot
A Monte Carlo factoring algorithm with finite storage
inferred← citeshttps://doi.org/10.1007/bfb0055857openalex-snapshot
On the security of some variants of the RSA signature scheme
inferred← citeshttps://doi.org/10.1007/pl00003816openalex-snapshot
Parallel Collision Search with Cryptanalytic Applications
inferred← citeshttps://doi.org/10.1007/s00200-013-0185-0openalex-snapshot
Improved algorithm for the isogeny problem for ordinary elliptic curves
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/s00208-012-0799-8openalex-snapshot
Periods of rational maps modulo primes
inferred← citeshttps://doi.org/10.1007/s10114-005-0632-3openalex-snapshot
Solving the Multi–discrete Logarithm Problems over a Group of Elliptic Curves with Prime Order
inferred← citeshttps://doi.org/10.1007/s10623-011-9527-8openalex-snapshot
A low-memory algorithm for finding short product representations in finite groups
inferred← citeshttps://doi.org/10.1007/s10623-011-9599-5openalex-snapshot
Speeding up elliptic curve discrete logarithm computations with point halving
inferred← citeshttps://doi.org/10.1007/s10623-018-0545-7openalex-snapshot
The graph structure of Chebyshev polynomials over finite fields and applications
inferred← citeshttps://doi.org/10.1007/s10623-018-0547-5openalex-snapshot
The functional graph of linear maps over finite fields and applications
inferred← citeshttps://doi.org/10.1007/s10958-012-0755-xopenalex-snapshot
Cycle detection algorithms and their applications
inferred← citeshttps://doi.org/10.1007/s13389-015-0108-zopenalex-snapshot
Harder, better, faster, stronger: elliptic curve discrete logarithm computations on FPGAs
inferred← citeshttps://doi.org/10.1007/s13389-022-00297-8openalex-snapshot
Design and implementation of a novel cryptographically secure pseudorandom number generator
inferred← citeshttps://doi.org/10.1016/0012-365x(86)90024-5openalex-snapshot
Combinatorial cycles of a polynomial map over a commutative field
inferred← citeshttps://doi.org/10.1016/0022-0000(83)90007-7openalex-snapshot
Lower bounds for the cycle detection problem
inferred← citeshttps://doi.org/10.1016/0167-4048(87)90070-8openalex-snapshot
Implementing the RSA cryptosystem
inferred← citeshttps://doi.org/10.1016/0196-6774(82)90012-8openalex-snapshot
Refined analysis and improvements on some factoring algorithms
inferred← citeshttps://doi.org/10.1016/0196-8858(86)90023-0openalex-snapshot
Sequences of numbers generated by addition in formal groups and new primality and factorization tests
inferred← citeshttps://doi.org/10.1016/0304-3975(76)90050-5openalex-snapshot
Analysis of a simple factorization algorithm
inferred← citeshttps://doi.org/10.1016/0890-5401(91)90001-iopenalex-snapshot
Toward a theory of Pollard's rho method
inferred← citeshttps://doi.org/10.1016/0898-1221(82)90026-8openalex-snapshot
The influence of computers in the development of number theory
inferred← citeshttps://doi.org/10.1016/j.asej.2022.101752openalex-snapshot
LAMAS: Lightweight anonymous mutual authentication scheme for securing fog computing environments
inferred← citeshttps://doi.org/10.1016/j.camwa.2011.02.027openalex-snapshot
Prime factorization using square root approximation
inferred← citeshttps://doi.org/10.1016/j.cpc.2018.09.005openalex-snapshot
Rings: An efficient Java/Scala library for polynomial rings
inferred← citeshttps://doi.org/10.1016/j.disc.2023.113393openalex-snapshot
On the functional graph of the power map over finite groups
inferred← citeshttps://doi.org/10.1016/j.disc.2025.114500openalex-snapshot
The graph of a family of functions over quadratic extensions of finite fields
inferred← citeshttps://doi.org/10.1016/j.ic.2006.04.003openalex-snapshot
On computing ordN(2) and its application
inferred← citeshttps://doi.org/10.1016/j.ic.2024.105169openalex-snapshot
Solving modular cubic equations with Coppersmith's method
inferred← citeshttps://doi.org/10.1016/j.ins.2011.04.002openalex-snapshot
Discrete logarithm based additively homomorphic encryption and secure data aggregation
inferred← citeshttps://doi.org/10.1016/j.ipl.2004.01.016openalex-snapshot
Cycle detection using a stack
inferred← citeshttps://doi.org/10.1016/j.ipl.2005.09.014openalex-snapshot
Efficient polynomial time algorithms computing industrial-strength primitive roots
inferred← citeshttps://doi.org/10.1016/j.jalgor.2003.09.002openalex-snapshot
Cycles in random k-ary maps and the poor performance of random number generation
inferred← citeshttps://doi.org/10.1016/j.jcta.2024.105875openalex-snapshot
On the deepest cycle of a random mapping
inferred← citeshttps://doi.org/10.1016/j.jisa.2018.11.009openalex-snapshot
Bluetooth Secure Simple Pairing with enhanced security level
inferred← citeshttps://doi.org/10.1016/j.jnt.2016.07.002openalex-snapshot
On multidimensional Diophantine approximation of algebraic numbers
inferred← citeshttps://doi.org/10.1016/j.parco.2022.102944openalex-snapshot
Improving cryptanalytic applications with stochastic runtimes on GPUs and multicores
inferred← citeshttps://doi.org/10.1016/j.segan.2024.101461openalex-snapshot
A comprehensive and secure scheme for privacy-preserving smart meter data aggregation in the smart grid
inferred← citeshttps://doi.org/10.1016/j.tcs.2026.115926openalex-snapshot
Quantum collision search for ternary LWE keys
inferred← citeshttps://doi.org/10.1016/s0012-365x(03)00158-4openalex-snapshot
On the iteration of certain quadratic maps over GF(p)
inferred← citeshttps://doi.org/10.1017/cbo9781139013673openalex-snapshot
Cryptography and Secure Communication
inferred← citeshttps://doi.org/10.1049/el:19930055openalex-snapshot
Determination of the true value of the Euler totient function in the RSA cryptosystem from a set of possibilities
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.1063/5.0265292openalex-snapshot
Blockchain-based secure mutual authentication and key agreement framework for smart grid
inferred← citeshttps://doi.org/10.1080/00029890.1984.11971425openalex-snapshot
Factorization and Primality Tests
inferred← citeshttps://doi.org/10.1080/00029890.1986.11971949openalex-snapshot
Factoring Large Numbers on a Pocket Calculator
inferred← citeshttps://doi.org/10.1080/0025570x.2025.2509470openalex-snapshot
A Birthday Attack on the Birthday Problem
inferred← citeshttps://doi.org/10.1080/09720502.2010.10700681openalex-snapshot
Sufficient conditions for factoring a class of large integers
inferred← citeshttps://doi.org/10.1080/09720529.2008.10698205openalex-snapshot
Algorithm for factoring some RSA and Rabin moduli
inferred← citeshttps://doi.org/10.1080/23799927.2018.1529709openalex-snapshot
Factoring RSA moduli when a message is close to a multiple of the primes
inferred← citeshttps://doi.org/10.1090/conm/461/08982openalex-snapshot
A multi-level blocking distinct-degree factorization algorithm
inferred← citeshttps://doi.org/10.1090/s0002-9939-1984-0722412-xopenalex-snapshot
Mullin's Sequence of Primes is not Monotonic
inferred← citeshttps://doi.org/10.1090/s0025-5718-00-01213-8openalex-snapshot
On random walks for Pollard’s rho method
inferred← citeshttps://doi.org/10.1090/s0025-5718-00-01215-1openalex-snapshot
Finding strong pseudoprimes to several bases
inferred← citeshttps://doi.org/10.1090/s0025-5718-03-01545-xopenalex-snapshot
Finding strong pseudoprimes to several bases. II
inferred← citeshttps://doi.org/10.1090/s0025-5718-1978-0491431-9openalex-snapshot
Monte Carlo methods for index computation (𝑚𝑜𝑑𝑝)
inferred← citeshttps://doi.org/10.1090/s0025-5718-1979-0514834-3openalex-snapshot
A Search for Large Twin Prime Pairs
inferred← citeshttps://doi.org/10.1090/s0025-5718-1981-0606520-5openalex-snapshot
Factorization of the Eighth Fermat Number
inferred← citeshttps://doi.org/10.1090/s0025-5718-1983-0717713-2openalex-snapshot
New Integer Factorizations
inferred← citeshttps://doi.org/10.1090/s0025-5718-1984-0744939-5openalex-snapshot
A Monte Carlo Factoring Algorithm With Linear Storage
inferred← citeshttps://doi.org/10.1090/s0025-5718-1985-0777282-xopenalex-snapshot
Modular Multiplication Without Trial Division
inferred← citeshttps://doi.org/10.1090/s0025-5718-1986-0856714-3openalex-snapshot
The primality of 𝑅1031
inferred← citeshttps://doi.org/10.1090/s0025-5718-1987-0866113-7openalex-snapshot
Speeding the Pollard and Elliptic Curve Methods of Factorization
inferred← citeshttps://doi.org/10.1090/s0025-5718-2014-02840-8openalex-snapshot
Computing prime divisors in an interval
inferred← citeshttps://doi.org/10.1090/s0025-5718-98-00936-3openalex-snapshot
A natural lattice basis problem with applications
inferred← citeshttps://doi.org/10.1090/s0025-5718-99-00992-8openalex-snapshot
Factorization of the tenth Fermat number
inferred← citeshttps://doi.org/10.1090/s0273-0979-2013-01423-xopenalex-snapshot
Euler’s constant: Euler’s work and modern developments
inferred← citeshttps://doi.org/10.1090/tran/8634openalex-snapshot
Periodic points of polynomials over finite fields
inferred← citeshttps://doi.org/10.1093/oso/9780198862840.001.0001openalex-snapshot
Cryptographic Primitives in Blockchain Technology
inferred← citeshttps://doi.org/10.1093/oso/9780198862840.002.0009openalex-snapshot
List of Abbreviations
showing the first 200 of 356 · page through all 356
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.