I’m still hard at work on my DSA assignment, which involves designing an RSA encryption algorithm. I figured out how to write the greatest common denominator (GCD) and modular exponentiation functions recursively, now I have to combine those into a modular multiplicative inverse (MMI) function. Woo hoo!
The good news is that I might actually finish today, a whole 24 hours before submission time! Technically I have until 11:59:59 Monday night to finish this stuff, but I really don’t want to wait that long (like I did last time, developing a critical error in my code last minute).
So with that, it’s back to work !