RSA encryption is an amazing thing. However, I am a little confused by how to find d, the inverse of e mod (p - 1)(q -1). I think that will be resolved just by seeing it done/actually doing it myself.
I was just amazed by how simple RSA is compared to DES and AES. It is such a simple algorithm. It's a beast to compute, but it's so simple, yet so secure. I'm just impressed by how slick RSA is.
No comments:
Post a Comment