Improved Pollard rho method for computing discrete logarithms over finite extension fields
type: Item
instance of: scholarly article
title: Improved Pollard rho method for computing discrete logarithms over finite extension fields
zbMATH Open document ID: 1277.94042
author: Fangguo Zhang
author: Ping Wang
published in: Journal of Computational and Applied Mathematics
publication date: 2012-08-03T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 11T71
Mathematics Subject Classification ID: 11Y16
zbMATH DE Number: 6063166
zbMATH Keywords: Pollard rho method
zbMATH Keywords: normal basis representation
zbMATH Keywords: discrete logarithm
MaRDI profile type: Publication
full work available at URL: j.cam.2012.03.019
OpenAlex ID: W2058130972
cites work: New directions in cryptography
cites work: A public key cryptosystem and a signature scheme based on discrete logarithms
cites work: Efficient signature generation by smart cards
cites work: Elliptic Curve Cryptosystems
cites work: Q3718617
cites work: Monte Carlo Methods for Index Computation (mod p)
cites work: Q4783728
cites work: Short signatures from the Weil pairing
cites work: Q4474195
cites work: Reducing elliptic curve logarithms to logarithms in a finite field
cites work: A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves
cites work: Improving the parallelized Pollard lambda search on anomalous binary curves
cites work: Q4250816
cites work: Parallel collision search with cryptanalytic applications
cites work: Subset-Restricted Random Walks for Pollard rho Method on ${\mathbf{F}_{p^m}}$
cites work: Probability Distributions Related to Random Mappings
cites work: An improved algorithm for computing logarithms over&lt;tex&gt;GF(p)&lt;/tex&gt;and its cryptographic significance (Corresp.)
cites work: Q3840196
cites work: Factorization of the Eighth Fermat Number
DOI: 10.1016/J.CAM.2012.03.019
description: scientific article; zbMATH DE number 6063166