IKBFU's Vestnik

2010 Issue №10

On the optimal passing of distinguished points for parallelized Pollard’s rho-method

Abstract

Problems of development and realization of an efficient parallelized algorithm to solve elliptic curve discrete logarithm problem (ECDLP) based on Pollard’s rho-method in the computational model SPMD using technology of message passing are considered. It is researched how many central processes are needed and what proportion of distinguished points is needed to be set to optimize an expected working time of this algorithm under the constraints of available memory; analyses the testing results of the developed program.

Download the article