Speeding up elliptic curve discrete logarithm computations with point halving
type: Item
instance of: scholarly article
title: Speeding up elliptic curve discrete logarithm computations with point halving
zbMATH Open document ID: 1305.11114
author: Fangguo Zhang
author: Ping Wang
published in: Designs, Codes and Cryptography
publication date: 2013-04-03T00:00:00Z
Mathematics Subject Classification ID: 11Y16
Mathematics Subject Classification ID: 11T71
Mathematics Subject Classification ID: 11G20
Mathematics Subject Classification ID: 14Q20
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 6150032
zbMATH Keywords: Pollard rho method
zbMATH Keywords: elliptic curve discrete logarithm
zbMATH Keywords: point halving
zbMATH Keywords: random walk
MaRDI profile type: Publication
full work available at URL: s10623-011-9599-5
OpenAlex ID: W2041584779
cites work: A Monte Carlo Factoring Algorithm With Linear Storage
cites work: Monte Carlo Methods for Index Computation (mod p)
cites work: Handbook of Elliptic and Hyperelliptic Curve Cryptography
cites work: Probability Distributions Related to Random Mappings
cites work: Batch Binary Edwards
cites work: On the Correct Use of the Negation Map in the Pollard rho Method
cites work: A method of solution of the problem of taking the discrete logarithm on an elliptic curve by division of points by two
cites work: On the Use of the Negation Map in the Pollard Rho Method
cites work: Factorization of the Eighth Fermat Number
cites work: Q3139838
cites work: New directions in cryptography
cites work: On random walks for Pollard's rho method
cites work: Improving the parallelized Pollard lambda search on anomalous binary curves
cites work: Q3802307
cites work: Q4502494
cites work: Elliptic Curve Cryptosystems
cites work: Speeding the Pollard and Elliptic Curve Methods of Factorization
cites work: A monte carlo method for factorization
cites work: Q3840196
cites work: Parallel collision search with cryptanalytic applications
cites work: Q4250816
DOI: 10.1007/S10623-011-9599-5
Recommended article: Speeding up the computations of elliptic curves cryptoschemes
Recommended article: Fast and Flexible Elliptic Curve Point Arithmetic over Prime Fields
Recommended article: Fast Point Multiplication Algorithms for Binary Elliptic Curves with and without Precomputation
Recommended article: Fast Point Multiplication on Elliptic Curves without Precomputation
Recommended article: Q4783726
Recommended article: Fast Point Decompression for Standard Elliptic Curves
Recommended article: Efficient algorithms for speeding up the computations of elliptic curve cryptosystems
Recommended article: Computing elliptic curve discrete logarithms with improved baby-step giant-step algorithm
Recommended article: Q4426683
Recommended article: Q4737244
description: scientific article; zbMATH DE number 6150032