Thursday, October 14, 2010

3.9 due October 15

This section was pretty cool. It was neat that it provided such a cool way to factor n quickly. I guess I would be interested to know how often it works out so that you could use this method, or how we can implement RSA in a way that would prevent this attack.
I think that I understood everything pretty well and had a good handle on the proofs, but it would definitely help to go through them again tomorrow.

No comments:

Post a Comment