I'm doing the same thing with a different approach. I'm rubber duck debugging my learning by typing things out and going into lots of numerical examples with the help of Python.
It's a very verbose way of learning but i can say i now truly understand Euler's theorem and Fermat's little theorem. I'm continuing this right now. The end goal will be to go deep on everything about RSA including the state of the art factorization algorithms.
It's a very verbose way of learning but i can say i now truly understand Euler's theorem and Fermat's little theorem. I'm continuing this right now. The end goal will be to go deep on everything about RSA including the state of the art factorization algorithms.
Current start documented here:
https://rawcdn.githack.com/AReallyGoodName/RDM/5391c5a90fe39...
Edit: All my formatting was messed up. I'll fix it when i finish, i'm sure it's not a mystery that the powers are meant to be superscripted though.