The most difficult part of the reading in this section was just trying to understand how finding the four solutions to our congruence (mod n) where n = pq is equivalent to factoring pq.
The fact that the section is summed up by explaining that solving these congruences is equivalent to factoring some n = pq where p and q are primes makes it obvious that we can examine this method in the context of RSA. However, I'm guessing that the mechanics of RSA will make it so that this method will not be very useful.
No comments:
Post a Comment