On the public citation graph
Speeding up Pollard's rho method for computing discrete logarithms
0 signed · 130 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-39799-x_31openalex-snapshot
Use of Elliptic Curves in Cryptography
inferredcites →https://doi.org/10.1007/978-1-4684-0310-7openalex-snapshot
A Course in Number Theory and Cryptography
inferredcites →https://doi.org/10.1007/978-1-4757-1920-8openalex-snapshot
The Arithmetic of Elliptic Curves
inferredcites →https://doi.org/10.1007/bf01199265openalex-snapshot
Random walks supported on random points ofZ/nZ
inferredcites →https://doi.org/10.1007/bf01933190openalex-snapshot
An improved Monte Carlo factorization algorithm
inferredcites →https://doi.org/10.1007/pl00003816openalex-snapshot
Parallel Collision Search with Cryptanalytic Applications
inferredcites →https://doi.org/10.1017/cbo9781107360211openalex-snapshot
Elliptic Curves in Cryptography
inferredcites →https://doi.org/10.1090/pspum/020/0316385openalex-snapshot
Class number, a theory of factorization, and genera
inferredcites →https://doi.org/10.1090/s0025-5718-1978-0491431-9openalex-snapshot
Monte Carlo methods for index computation (𝑚𝑜𝑑𝑝)
inferredcites →https://doi.org/10.1090/s0025-5718-1984-0744939-5openalex-snapshot
A Monte Carlo Factoring Algorithm With Linear Storage
inferredcites →https://doi.org/10.1090/s0025-5718-1987-0866109-5openalex-snapshot
Elliptic Curve Cryptosystems
inferredcites →https://doi.org/10.1090/s0025-5718-98-00968-5openalex-snapshot
A space efficient algorithm for group structure computation
inferredcites →https://doi.org/10.1093/comjnl/17.4.324openalex-snapshot
The Art of Computer Programming, Volume 3, Sorting and Searching
inferredcites →https://doi.org/10.1109/tit.1978.1055817openalex-snapshot
An improved algorithm for computing logarithms overGF(p)and its cryptographic significance (Corresp.)
inferredcites →https://doi.org/10.22028/d291-25831openalex-snapshot
LiDIA : a library for computational number theory
inferredcites →https://doi.org/10.2307/2006496openalex-snapshot
Monte Carlo Methods for Index Computation (mod p)
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/spy2.234openalex-snapshot
An initial step toward a quantum annealing approach to the discrete logarithm problem
inferred← citeshttps://doi.org/10.1007/11761679_1openalex-snapshot
Security Analysis of the Strong Diffie-Hellman Problem
inferred← citeshttps://doi.org/10.1007/3-540-44983-3_8openalex-snapshot
Speeding up the Arithmetic on Koblitz Curves of Genus Two
inferred← citeshttps://doi.org/10.1007/3-540-45067-x_6openalex-snapshot
The Security of Fixed versus Random Elliptic Curves in Cryptography
inferred← citeshttps://doi.org/10.1007/3-540-45311-3_19openalex-snapshot
Analysis of the GHS Weil Descent Attack on the ECDLP over Characteristic Two Finite Fields of Composite Degree
inferred← citeshttps://doi.org/10.1007/3-540-45455-1_33openalex-snapshot
Random Cayley Digraphs and the Discrete Logarithm
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-45537-x_17openalex-snapshot
Random Walks Revisited: Extensions of Pollard’s Rho Algorithm for Computing Multiple Discrete Logarithms
inferred← citeshttps://doi.org/10.1007/3-540-45539-6_2openalex-snapshot
An Algorithm for Solving the Discrete Log Problem on Hyperelliptic Curves
inferred← citeshttps://doi.org/10.1007/3-540-48892-8_15openalex-snapshot
Faster Attacks on Elliptic Curve Cryptosystems
inferred← citeshttps://doi.org/10.1007/978-0-387-09494-6_10openalex-snapshot
Computing the Mordell–Weil Group
inferred← citeshttps://doi.org/10.1007/978-0-387-09494-6_11openalex-snapshot
Algorithmic Aspects of Elliptic Curves
inferred← citeshttps://doi.org/10.1007/978-0-387-09494-6_3openalex-snapshot
The Geometry of Elliptic Curves
inferred← citeshttps://doi.org/10.1007/978-0-387-09494-6_4openalex-snapshot
The Formal Group of an Elliptic Curve
inferred← citeshttps://doi.org/10.1007/978-0-387-09494-6_5openalex-snapshot
Elliptic Curves over Finite Fields
inferred← citeshttps://doi.org/10.1007/978-0-387-09494-6_6openalex-snapshot
Elliptic Curves over ℂ $$\mathbb{C}$$
inferred← citeshttps://doi.org/10.1007/978-0-387-09494-6_7openalex-snapshot
Elliptic Curves over Local Fields
inferred← citeshttps://doi.org/10.1007/978-0-387-09494-6_8openalex-snapshot
Elliptic Curves over Global Fields
inferred← citeshttps://doi.org/10.1007/978-0-387-09494-6_9openalex-snapshot
Integral Points on Elliptic Curves
inferred← citeshttps://doi.org/10.1007/978-0-387-71817-0_8openalex-snapshot
Elliptic and Hyperelliptic Curve Cryptography
inferred← citeshttps://doi.org/10.1007/978-1-4419-5906-5_246openalex-snapshot
Elliptic Curve Discrete Logarithm Problem
inferred← citeshttps://doi.org/10.1007/978-1-4939-1711-2_5openalex-snapshot
Combinatorics, Probability, and Information Theory
inferred← citeshttps://doi.org/10.1007/978-3-030-32101-7_24openalex-snapshot
Short Paper: The Proof is in the Pudding
inferred← citeshttps://doi.org/10.1007/978-3-030-42921-8_32openalex-snapshot
Improving ECDLP Computation in Characteristic 2
inferred← citeshttps://doi.org/10.1007/978-3-030-71522-9_246openalex-snapshot
Elliptic Curve Discrete Logarithm Problem
inferred← citeshttps://doi.org/10.1007/978-3-031-94448-2_14openalex-snapshot
Dynamically Expanding Factor Base of Index Calculus Algorithm to Solve Massive Discrete Logarithm Problems Faster
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-22174-8_17openalex-snapshot
Attacking a Binary GLS Elliptic Curve with Magma
inferred← citeshttps://doi.org/10.1007/978-3-540-24847-7_15openalex-snapshot
A Low-Memory Parallel Version of Matsuo, Chao, and Tsujii’s Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-540-24847-7_17openalex-snapshot
A Comparison of CEILIDH and XTR
inferred← citeshttps://doi.org/10.1007/978-3-540-48000-6_10openalex-snapshot
Speeding up the Discrete Log Computation on Curves with Automorphisms
inferred← citeshttps://doi.org/10.1007/978-3-540-73489-5_17openalex-snapshot
Remarks on Cheon’s Algorithms for Pairing-Related Problems
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-89255-7_29openalex-snapshot
Speeding Up the Pollard Rho Method on Prime Fields
inferred← citeshttps://doi.org/10.1007/978-3-642-00468-1_4openalex-snapshot
Subset-Restricted Random Walks for Pollard rho Method on ${\mathbf{F}_{p^m}}$
inferred← citeshttps://doi.org/10.1007/978-3-642-02181-7_14openalex-snapshot
Word Oriented Cascade Jump σ−LFSR
inferred← citeshttps://doi.org/10.1007/978-3-642-17610-4_5openalex-snapshot
On Distinguished Points Method to Implement a Parallel Collision Search Attack on ECDLP
inferred← citeshttps://doi.org/10.1007/978-3-642-27739-9_246-2openalex-snapshot
Elliptic Curve Discrete Logarithm Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-27890-7_8openalex-snapshot
Solving a DLP with Auxiliary Input with the ρ-Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-642-30057-8_35openalex-snapshot
Solving a Discrete Logarithm Problem with Auxiliary Input on a 160-Bit Elliptic Curve
inferred← citeshttps://doi.org/10.1007/978-3-642-31448-3_9openalex-snapshot
Cryptanalysis of RSA with a Small Parameter
inferred← citeshttps://doi.org/10.1007/978-3-642-32928-9_17openalex-snapshot
On the Strength Comparison of the ECDLP and the IFP
inferred← citeshttps://doi.org/10.1007/978-3-642-57189-3_4openalex-snapshot
Discrete Logarithms: Recent Progress
inferred← citeshttps://doi.org/10.1007/978-3-662-46447-2_6openalex-snapshot
Collision of Random Walks and a Refined Analysis of Attacks on the Discrete Logarithm Problem
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/s00145-003-0213-5openalex-snapshot
The Full Cost of Cryptanalytic Attacks
inferred← citeshttps://doi.org/10.1007/s00145-009-9047-0openalex-snapshot
Discrete Logarithm Problems with Auxiliary Inputs
inferred← citeshttps://doi.org/10.1007/s00145-010-9093-7openalex-snapshot
Accelerating Pollard’s Rho Algorithm on Finite Fields
inferred← citeshttps://doi.org/10.1007/s001450010010openalex-snapshot
Kangaroos, Monopoly and Discrete Logarithms
inferred← citeshttps://doi.org/10.1007/s00200-016-0291-xopenalex-snapshot
Computational hardness of IFP and ECDLP
inferred← citeshttps://doi.org/10.1007/s10207-004-0045-9openalex-snapshot
The efficiency of solving multiple discrete logarithm problems and the implications for the security of fixed elliptic curves
inferred← citeshttps://doi.org/10.1007/s102070100002openalex-snapshot
The Elliptic Curve Digital Signature Algorithm (ECDSA)
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-014-0004-zopenalex-snapshot
Sequences with good correlation property based on depth and interleaving techniques
inferred← citeshttps://doi.org/10.1007/s12204-018-1919-8openalex-snapshot
A Note on the Behaviour of the Number Field Sieve in the Medium Prime Case: Smoothness of Norms
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.1016/j.cam.2012.03.019openalex-snapshot
Improved Pollard rho method for computing discrete logarithms over finite extension fields
inferred← citeshttps://doi.org/10.1016/j.dam.2019.03.023openalex-snapshot
Solving discrete logarithm problems faster with the aid of pre-computation
inferred← citeshttps://doi.org/10.1016/j.ins.2012.01.044openalex-snapshot
Computing elliptic curve discrete logarithms with the negation map
inferred← citeshttps://doi.org/10.1016/j.jsc.2020.04.011openalex-snapshot
On computing the degree of a Chebyshev Polynomial from its value
inferred← citeshttps://doi.org/10.1016/j.sigpro.2018.10.011openalex-snapshot
A novel image encryption scheme based on an elliptic curve
inferred← citeshttps://doi.org/10.1017/cbo9780511546570.012openalex-snapshot
Cryptography from Pairings
inferred← citeshttps://doi.org/10.1023/a:1008350005447openalex-snapshot
Discrete Logarithms: The Past and the Future
inferred← citeshttps://doi.org/10.1063/5.0109302openalex-snapshot
How to rapid prototype a blockchain-based iot network
inferred← citeshttps://doi.org/10.1080/09720529.2015.1084782openalex-snapshot
On improvements of ther-adding walk in a finite field of characteristic 2
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-01-01343-6openalex-snapshot
The parallelized Pollard kangaroo method in real quadratic function fields
inferred← citeshttps://doi.org/10.1090/s0025-5718-2013-02748-2openalex-snapshot
Computing discrete logarithms in the Jacobian of high-genus hyperelliptic curves over even characteristic finite fields
inferred← citeshttps://doi.org/10.1090/s0025-5718-99-01119-9openalex-snapshot
Improving the parallelized Pollard lambda search on anomalous binary curves
inferred← citeshttps://doi.org/10.1109/access.2021.3055866openalex-snapshot
A Virtual Optical Holographic Encryption System Using Expanded Diffie-Hellman Algorithm
inferred← citeshttps://doi.org/10.1109/aina.2011.37openalex-snapshot
Experimantal Analysis of Cheon's Algorithm Against Pairing-Friendly Curves
inferred← citeshttps://doi.org/10.1109/bigdata66926.2025.11402420openalex-snapshot
Secure and Privacy-Preserving Federated Learning for Next-Generation Underground Mine Safety
inferred← citeshttps://doi.org/10.1109/candar51075.2020.00029openalex-snapshot
Analysis of a method to eliminate fruitless cycles for Pollard’s rho method with skew Frobenius mapping over a Barreto-Naehrig curve
inferred← citeshttps://doi.org/10.1109/candar57322.2022.00022openalex-snapshot
A Method to Eliminate Fruitless Cycles for Pollard's Rho Method by Splitting a Seed-point Table for a Random Walk
inferred← citeshttps://doi.org/10.1109/candarw.2019.00068openalex-snapshot
A Preliminary Study on Methods to Eliminate Short Fruitless Cycles for Pollard's Rho Method for ECDLP over BN Curves
inferred← citeshttps://doi.org/10.1109/cec.2017.7969342openalex-snapshot
Genetic programming for improved cryptanalysis of elliptic curve cryptosystems
inferred← citeshttps://doi.org/10.1109/chinacom.2013.6694721openalex-snapshot
Depth, ultimate period, and distribution of sequences of period pr ?? 1
inferred← citeshttps://doi.org/10.1109/eidwt.2013.55openalex-snapshot
Improving the Parallelized Pollard Rho Method for Computing Elliptic Curve Discrete Logarithms
inferred← citeshttps://doi.org/10.1109/focs.2007.38openalex-snapshot
Near Optimal Bounds for Collision in Pollard Rho for Discrete Log
inferred← citeshttps://doi.org/10.1109/focs.2007.4389494openalex-snapshot
Near Optimal Bounds for Collision in Pollard Rho for Discrete Log
inferred← citeshttps://doi.org/10.1109/focs.2007.44openalex-snapshot
Round Complexity of Authenticated Broadcast with a Dishonest Majority
inferred← citeshttps://doi.org/10.1109/icmcs.2012.6320288openalex-snapshot
Improving Pollard's Rho attack on elliptic curve cryptosystems
inferred← citeshttps://doi.org/10.1109/imis.2011.113openalex-snapshot
Time Estimation of Cheon's Algorithm over Elliptic Curves on Finite Fields with Characteristic 3
inferred← citeshttps://doi.org/10.1109/ipdps.2008.4536244openalex-snapshot
Distributed asymmetric verification in computational grids
inferred← citeshttps://doi.org/10.1109/itc-cscc55581.2022.9894912openalex-snapshot
Effectiveness of a Method to Eliminate Fruitless Cycles for Pollard's Rho Method
inferred← citeshttps://doi.org/10.1109/itc-cscc58803.2023.10212890openalex-snapshot
Method to Eliminate Fruitless Cycles for Pollard's Rho Method with Splitting Table
inferred← citeshttps://doi.org/10.1109/sbac-pad.2017.12openalex-snapshot
Scalability of CPU and GPU Solutions of the Prime Elliptic Curve Discrete Logarithm Problem
inferred← citeshttps://doi.org/10.1109/tip.2012.2204272openalex-snapshot
Image Feature Extraction in Encrypted Domain With Privacy-Preserving SIFT
inferred← citeshttps://doi.org/10.1112/s1461157000000723openalex-snapshot
Analysis of the GHS Weil Descent Attack on the ECDLP over Characteristic Two Finite Fields of Composite Degree
inferred← citeshttps://doi.org/10.1137/s0036144503439190openalex-snapshot
A Survey of Public-Key Cryptosystems
inferred← citeshttps://doi.org/10.1142/9789812388841_0005openalex-snapshot
COMPUTATIONAL METHODS IN PUBLIC KEY CRYPTOLOGY
inferred← citeshttps://doi.org/10.1145/1371579.1371580openalex-snapshot
Special-Purpose Hardware for Solving the Elliptic Curve Discrete Logarithm Problem
inferred← citeshttps://doi.org/10.1155/2012/439021openalex-snapshot
A Hardware-Accelerated ECDLP with High-Performance Modular Multiplication
inferred← citeshttps://doi.org/10.1155/2012/635909openalex-snapshot
An Efficient Collision Detection Method for Computing Discrete Logarithms with Pollard′s Rho
inferred← citeshttps://doi.org/10.1214/09-aap625openalex-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.14489/vkit.2025.04.pp.045-051openalex-snapshot
METHOD OF POINT MULTIPLICATION ON THE EDWARDS25519 ELLIPTIC CURVE APPLIED TO RESOURCE-CONSTRAINED DEVICES
inferred← citeshttps://doi.org/10.15373/22501991/jan2013/11openalex-snapshot
Efficient Black-Box Collision Search in cryptanalysis
inferred← citeshttps://doi.org/10.15803/ijnc.11.2_231openalex-snapshot
Sophisticated analysis of a method to eliminate fruitless cycles for Pollard's rho method with skew Frobenius mapping over a Barreto-Naehrig curve
inferred← citeshttps://doi.org/10.19080/bboaj.2018.04.555633openalex-snapshot
A Re-Examine on Assorted Digital Image Encryption | Algorithm's Techniques
inferred← citeshttps://doi.org/10.2197/ipsjjip.19.441openalex-snapshot
Experimental Analysis of Cheon's Algorithm against Pairing-friendly Curves
inferred← citeshttps://doi.org/10.23919/icn.2026.0017openalex-snapshot
Solving the Elliptic Curve Discrete Logarithm Problem Using Quantum Tunneling Effects on the D-Wave Advantage2 Quantum Computer
inferred← citeshttps://doi.org/10.30598/barekengvol16iss4pp1159-1166openalex-snapshot
MODIFICATION OF POLLARD RHO ALGORITHM USING NEGATION MAPPING
inferred← citeshttps://doi.org/10.3844/jcssp.2014.1575.1581openalex-snapshot
A VARIANT OF POLLARDS RHO ATTACK ON ELLIPTIC CURVE CRYPTOSYSTEMS
inferred← citeshttps://doi.org/10.3844/jcssp.2015.971.975openalex-snapshot
New Collisions to Improve Pollard’s Rho Method of Solving the Discrete Logarithm Problem on Elliptic Curves
inferred← citeshttps://doi.org/10.4134/jkms.2015.52.4.797openalex-snapshot
ANALYSIS OF POSSIBLE PRE-COMPUTATION AIDED DLP SOLVING ALGORITHMS
inferred← citeshttps://doi.org/10.47839/ijc.6.3.456openalex-snapshot
DISTRIBUTED TRUST IN ePAYMENTS SYSTEM
inferred← citeshttps://doi.org/10.48550/arxiv.1601.04134openalex-snapshot
On improvements of the $r$-adding walk in a finite field of characteristic 2
inferred← citeshttps://doi.org/10.5075/epfl-thesis-4506openalex-snapshot
Analysis and design of symmetric cryptographic algorithms
inferred← citeshttps://doi.org/10.5075/epfl-thesis-5291openalex-snapshot
On the Cryptanalysis of Public-Key Cryptography
inferred← citeshttps://doi.org/10.5902/2179460x87825openalex-snapshot
Análise da complexidade dos algoritmos de Criptografia Homomórfica
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.