PARALLELIZATION OF ρ - AND λ - POLLARD’S METHODS FOR SOLVING THE DISCRETE LOGARITHM

D. M. Andrushchenko, M. U. Varava, G. V. Nelasa

Abstract


The parallelization efficiency of ρ - and λ -methods of Pollard in solving the discrete logarithm is analyzed. The theoretical estimate of the time of the task on a parallel system is given. Comparison of the practical and theoretical calculations carried out. Timing performance threaded methods are made.

Keywords


methods of Pollard’s, discrete logarithm, paralleling, the complexity of the cryptographic algorithm, estimation of complexity.

GOST Style Citations






DOI: https://doi.org/10.15588/1607-3274-2011-2-6



Copyright (c) 2014 D. M. Andrushchenko, M. U. Varava, G. V. Nelasa

Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

Address of the journal editorial office:
Editorial office of the journal «Radio Electronics, Computer Science, Control»,
Zaporizhzhya National Technical University, 
Zhukovskiy street, 64, Zaporizhzhya, 69063, Ukraine. 
Telephone: +38-061-769-82-96 – the Editing and Publishing Department.
E-mail: rvv@zntu.edu.ua

The reference to the journal is obligatory in the cases of complete or partial use of its materials.