1. (Difficult): I got all of it except one thing. It said a was congruent to b mod pq. Shouldn't that be a^2 is congruent to b^2 mod pq? That's what it looks like in the example on the bottom of page 87 using 15 and 29.
And why is the factoring of n not quick? It looks like they did it quick in the books example using mod 77. Or does it just mean it's hard to factor quick for large n? That makes more sense.
2. (Reflection): I like that this uses the Chinese remainder theorem because I understand that. Now how are we going to use quadratic modular equations in cryptography?
No comments:
Post a Comment