I suppose that the hardest part was solving ax + by = d, though this assignment wasn't too hard. I found a website that talks about this and its relation to the euclidean algorithm, http://home.hccnet.nl/david.dirkse/math/axbyc.html.
I am excited about the modular exponentiation that is coming up, it relates directly to RSA which has fascinated me for a while. Since reading the section on RSA some of the mystery is taken away, but it is even cooler now because I understand how it works. It is so cool that you can have a code where everyone knows the encryption key and it is still secure. Well, tomorrow we start working on a cipher system, hope to make it strong enough to prove a challenge.
No comments:
Post a Comment