Difficult:
I think I need a quick refresher on how logarithms work again. I'm not really sure what makes a discrete logarithm different than a regular logarithm. Also, I think that a know plaintext attack on RSA is essentially a discrete logarithm attack. Because m =c^d (mod n), if we know m, c, and n, if we find d we have found the secret key of RSA.
Reflective:
I think it is interesting how people get worried about RSA breaking when it can take a lot of work to find the secret key. I think that people are worried that if we have a slow algorithm now, as computers get faster we will be able to break RSA even with this slow algorithm. While this is interesting, it seems we could just use larger keys which because our computers are faster will still be fast to encrypt and decrypt.
No comments:
Post a Comment