1. I thought the difficult part of this reading was understanding "smoothness." I didn't understand why it is best suited for medium numbers either.
2. I really liked the analogy of the p-1 method to factoring elliptic curves. Although does that make elliptic curve cryptography weaker because all a hacker has to do is try several curves to factor n? I thought singular curves were interesting.
No comments:
Post a Comment