Accelerating Pollard's rho algorithm on finite fields
type: Item
instance of: scholarly article
title: Accelerating Pollard's rho algorithm on finite fields
zbMATH Open document ID: 1277.94018
author: Jung Hee Cheon
author: Jin Hong
author: Minkyu Kim
published in: Journal of Cryptology
publication date: 2012-07-03T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 05C80
Mathematics Subject Classification ID: 11T71
Mathematics Subject Classification ID: 11Y16
zbMATH DE Number: 6052394
zbMATH Keywords: discrete logarithm problem
zbMATH Keywords: Pollard's rho
zbMATH Keywords: \(r\)-adding walk
zbMATH Keywords: distinguished point
zbMATH Keywords: finite field
describes a project that uses: NTL
MaRDI profile type: Publication
full work available at URL: s00145-010-9093-7
OpenAlex ID: W2011765981
cites work: Solving a 112-bit prime elliptic curve discrete logarithm problem on game consoles using sloppy reduction
cites work: An improved Monte Carlo factorization algorithm
cites work: Speeding Up the Pollard Rho Method on Prime Fields
cites work: Fast evaluation of logarithms in fields of characteristic two
cites work: New directions in cryptography
cites work: Q4502491
cites work: A public key cryptosystem and a signature scheme based on discrete logarithms
cites work: Q3973158
cites work: Improving the parallelized Pollard lambda search on anomalous binary curves
cites work: Subset-Restricted Random Walks for Pollard rho Method on ${\mathbf{F}_{p^m}}$
cites work: A birthday paradox for Markov chains with an optimal bound for collision in the Pollard rho algorithm for discrete logarithm
cites work: Q5585021
cites work: Q4057549
cites work: Q4718481
cites work: Cycle detection using a stack
cites work: An improved algorithm for computing logarithms over&lt;tex&gt;GF(p)&lt;/tex&gt;and its cryptographic significance (Corresp.)
cites work: Monte Carlo Methods for Index Computation (mod p)
cites work: Kangaroos, monopoly and discrete logarithms
cites work: Q3802307
cites work: A Monte Carlo Factoring Algorithm With Linear Storage
cites work: Fast multiplication of large numbers
cites work: The Complexity of Finding Cycles in Periodic Functions
cites work: Q5628224
cites work: Q3840196
cites work: On random walks for Pollard's rho method
cites work: Computing discrete logarithms with the parallelized kangaroo method.
cites work: Parallel collision search with cryptanalytic applications
cites work: Polynomial and normal bases for finite fields
cites work: Q4250816
DOI: 10.1007/S00145-010-9093-7
description: scientific article; zbMATH DE number 6052394