1. I didn't follow the follow the portion where the modulus was a composite. I understood how the square roots were solved for the individuals mods, but then the combined part to get the four solutions lost me. The concept or the process of finding the square roots mod n is giving my brains some fits.
2. I thought it was interesting that given n=pq where p,q are primes, when a person finds the solutions to the squares, he/she finds the factors of n. Seeing how we are working with the RSA, this might be another way to attack the algorithm.
No comments:
Post a Comment