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

Authors

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

DOI:

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

Keywords:

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

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.

Published

2012-01-10

How to Cite

Andrushchenko, D. M., Varava, M. U., & Nelasa, G. V. (2012). PARALLELIZATION OF ρ - AND λ - POLLARD’S METHODS FOR SOLVING THE DISCRETE LOGARITHM. Radio Electronics, Computer Science, Control, (2). https://doi.org/10.15588/1607-3274-2011-2-6

Issue

Section

Mathematical and computer modelling