This work applies methodology for cryptosystem timing attacks to elliptic curve encryption using parametric coordinates. Additionally, we attempt to replicate the results found by Paul Kocher regarding timing attacks on RSA cryptosystems. Multiple implementations including Sage, MuPAD, Mathematica, and Python are attempted. Viability of timing attacks with modern computing power is assessed.