The most difficult part of the reading was the part about timing attacks. After reading that part I wasn't even really sure what a timing attack is.
This section changed some of my perceptions about RSA. Ever since I had learned about it, I had kind of just figured that it was basically unbreakable as long the primes p and q chosen to generate n are really large. But after reading this section, I can see that RSA can be broken if it is implemented sloppily, and there are actually effective ways to factor n into its original primes if n satisfies certain properties. Very interesting.
No comments:
Post a Comment