Compute Discrete Logarithms with Chinese Remainder and pollard rho

Posted: Δεκεμβρίου 28th, 2011 | Author: | Filed under: programming, python | 1 Comment »

I have implemented in python another algorithm for solving the discrete logarithm problem ( DLP ) using the Chinese Remainder Theorem and Pollard’s rho algorithm.

This algororithm factors the order n of the Group and computes the discrete log for each factor and combine the solutions using the Chinese Remainder Theorem.

One Comment on “Compute Discrete Logarithms with Chinese Remainder and pollard rho”

  1. 1 Pollard’s rho algorithm for computing dicrete logarithms | gkomninos.com said at 17:27 on Ιανουαρίου 12th, 2012:

    [...] If we want to compute the discrete logarithm of an element B in a group Gp with order p-1 (not prime) it is better to use the Chinese Remainder Theorem and POllard Rho method. [...]

Leave a Reply