Cryptography, Cybersecurity, Elliptic Curve, Ecc.
deal with integers, so we must modify this with a modular form of: y² = x³ + ax + b (mod p) For example, if a is zero, b is 7, and the prime is 11, we get: y² = x³ + 7 (mod 11) The possible points are (2, 9) (2, 2) (3, 1) (3, 10) (4, 4) (4, 7) (5, 0) (6, 5) (6, 6) (7, 3) (7, 8). e can try it, and