Using a deterministic partitioning function for Pollard's RHO method paralellization

Бесплатный доступ

An improved method for parallelization of Pollard’s algorithm for solving the discrete logarithm problem in a group of elliptic curve points and in a multiplicative group of a Galois field for shared memory systems is suggested in the paper. Improvement of the method is achieved by constructing a deterministic partitioning function. Such a function allows to organize two independent load balancing computational threads for building a block of group elements of fixed length. Also we analyze advanced iteration functions for Pollard’s algorithm and build generic deterministic partitioning function.

Discrete logarithm, pollard's rho method, elliptic curve

Короткий адрес: https://sciup.org/147160505

IDR: 147160505

Статья научная