Cryptography, Public Key Cryptography, Elliptic Curve, Ecc, Encryption.
computing the formula for the elliptic curve (y² = x³ + ax + b), we use modulus division as a trick of rolling over numbers when we hit the maximum. If we pick the maximum to be a prime number, the elliptic curve is called a prime curve and has excellent cryptographic properties. Our plot looks