Making a Ring
Published in
2 min readOct 6, 2019
There was a time before I understood rings in public key methods, and the time after it. I basically allowed me to understand how public key encryption and discrete logs work. Basically, I take a prime number (p), and then use a (mod p) operation, and it creates a ring.
For a ring in encryption, we create can a g value and have a prime number of N. For values of x, we get g^ x (mod N). For example if we use g=2 and N=42:
