Cryptography, Encryption, Programming, Security, Elliptic Curve.
infeasible to try and calculate the final colour, even for modern-day supercomputers. Breakdown 1 - I generate a prime number (called p) and a number (called g) which is coprime to p-1. I then tell you both those numbers. 2 - You pick a secret (called a). You then compute (gᵃ modulo p)(called A)