1. One thing that was taking me a lot of time to understand was the Low Exponent Attacks. They were trying to show if d<(1/3)N^(1/4), then d could be calculated quickly. They then go on to prove this, but it was super confusing with lots of different integers, roots, and powers. I think it was just looking really abstract to me, so it wasn't making much sense.
2. They mention in the book that these attacks to RSA are more because of mistakes. It made me think of what happened to Adobe recently. They were hacked, and the hackers got a bunch of account and credit card information. I don't know if they use RSA or something else, but I was really surprised to hear that a high up company like that getting hacked. I wonder if they just made a small mistake that allowed hackers to exploit, or if they were super super lucky.
No comments:
Post a Comment