The Elliptic Curve Method to Factor Integers

This video is about Lenstra’s Elliptic Curve Method to factor integers. It is sort of a generalization of Pollard’s p-1 method that is more reliable.

[franzscheerer]

Much faster than the sieve methods claimed to be the fastest methods. We need only one smooth number, the order of a randomly chosen point/curve. With the sieve methods we need many smooth numbers not considerably smaller than than the order of the group. These sieve methods also need much more memory for a prime base and a gigantic matrix.