1. (Difficult): So the 6.5 method is factoring squares and small primes out of n by guessing, is that correct? And what does the book mean when it keeps saying "relation" in 6.5?
I think 6.6 and 7.1 make sense, but I would like to see examples.
What does #4 mean in 6.7 when it says "it is easy to find the functions Ek and Dk"? That it's easy to determine what they are if you have no idea just from the key? Or that you know the idea of Ek and Dk and it's easy to substitute in k? How is that different than #2?
The non-repudiation and authentication technique for public keys discussed in 6.7 is pretty clever and cool I think. Seeing an RSA example isn't essential, but would be helpful.
2.(Reflection): In 6.7 #4 seems a lot like #2 I think, but otherwise it's really clear that RSA works because it meets properties #1-#4. I recognized that before, but it's nice to see it written out.
The non-repudiation and authentication technique for public keys discussed in 6.7 is pretty clever and cool I think. Seeing an RSA example isn't essential, but would be helpful.
It will be interesting to see what else we learn about discrete logarithms, how we use them, and how we break them.
No comments:
Post a Comment