Euclidean algorithm

• How to Compute the Modular Inverse in Elliptic-Curve Addition
  For elliptic-curve addition over a prime field, invert the coordinate difference modulo p with the extended Euclidean algorithm—not ordinary division.