The hardest part, and the part I am still not 100% on is how we pick the numbers squared from wich we find small primes. Are these semi-randomly chosed within the bounds of being just a little larger than n? Is there a set procedure for deriving these. This is the part that I can't quite grasp.
The coolest part was seeing how it is possible to generate these numbers that give us equations to solve the x*2 = y^2 (mod n) where x != y. It is cool to see how trivial the actuall work is. The real catch is in just how long it will take.
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment