1. This section was surprisingly understandable. One thing I'm a little unclear about is the subsection on discrete logarithms on elliptic curves. How exactly is this the same as the discrete logarithm problem? Also, are we going to learn how this problem can be solved using Pohlig-Hellman or Baby Step Giant Step attacks?
2. It was cool to begin to see how this seemingly obscure and unrelated concept may be used to factor large numbers. I still don't know exactly why elliptic curves mod a composite number could help in factoring the large number, but hopefully we will find that out soon. I also liked the method for manipulating a message so that it lies along an elliptic curve. It's nice.
No comments:
Post a Comment