Pollard's p-1
Factorising N when we know a factor is smooth
Overview
Example
Applications
Sage Code
We can implement this algorithm really easily in Sage:
You can remove the print()
functions as they are completely unneccessary, but the logging may help visualise what it does.
Last updated