1. RSA seems pretty straightforward compared to stuff we've learned previously like DES. I think the only thing I wasn't following was why we had to make sure de = 1(mod(p-1)(d-1)) and 1 = gcd (e, (p-1)(q-1). But I'm sure its just so that it's actually easy do decrypt for Bob.
2. Like I said before, I am just happy this isn't quite as complex as DES. That section killed me. This seems easy, which makes it seem like it should be easy to attack, but I'm sure it's not. I was blown away by how big the primes are though, 100 digits! That's crazy! I just hope we don't have to use super large primes for homework!
No comments:
Post a Comment