This makes use of the extended Euclidean GCD algorithm to calculate the inverse rather than using a built in library method. The decryption method calculates c^d (mod N) and uses my own implementation ...

"xgcd": calculate modular inverse using the extended euclidean algorithm. "DoubleandAdd": for a multiple of a point that takes advantage of doubling and addition algorithm.