Cryptography, Algorithms, Public Key Cryptography.
algorithm, and finally a small work-out. And as you’ve guessed gonna be a long journey, just bear with me. Elementary number theory Primitive roots: x is a primitive root of n if, for every y relatively prime to n, there is a z such that, For example, 2 is a primitive root of 5 while 4 isn’t.