Fermat’s factorization method in python
Posted: Νοεμβρίου 26th, 2011 | Author: Giorgos | Filed under: programming, python | Tags: cryptography, fermat, number theory | 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” »
Comments