Its interesting how using a random curve that we can can factor prime numbers. Probably factor numbers as large as we have ever worked with just by trying one random curve... Also it is still intriguing to me, that the thought process is "try to find 3P, oh it didnt work, well that helped us to factor n" which seems like a much trickier problem than finding 3P.
What I am confused about, is what is the doing this by hand method? How could we apply this on a the final, or what kinds of questions could be asked about it that I could solve by hand?
What are those other times besides RSA when I would want to factor a really large number...?
No comments:
Post a Comment