Pollard’s rho algorithm for computing dicrete logarithms

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

Here is an implementation in python of
Pollard’s rho method for computing the discrete logarithm. Continue reading “Pollard’s rho algorithm for computing dicrete logarithms” »

Fermat’s factorization method in python

Posted: Νοεμβρίου 26th, 2011 | Author: | Filed under: programming, python | Tags: , , | No Comments »

Few days ago I had to find the prime factors of a very big number N = 23360947609 .
Fermat proposed a method for finding the factors of positive odd integers.
His method is not very efficiently and in general you cannot compute the factors in polynomial time
( this assumption are based many cryptography applications),
but if the factors are close to the square root of N then it is possible.
Continue reading “Fermat’s factorization method in python” »