i got a little lost in all the calculations. the calculations didn’t look too complex, but there were some pretty big numbers. the order in which all the calculations need to be done was a little daunting, and i might have some trouble remembering which step happens when. but then again, maybe i don’t have to be responsible for knowing each step. i’m not sure. but doing examples will definitely help me solidify all this.
we’ve learned so many different methods for encrypting messages, but all of them would require a key in order to decrypt. i think it’s so interesting that this algorithm doesn’t require a key for decryption. also, it’s interesting how useful prime numbers can be.
No comments:
Post a Comment