The strength of public key cryptography utilizing Elliptic Curves relies on the difficulty of computing discrete logarithms in a finite field. Other public key cryptographic algorithms, such as RSA, rely on the difficulty of integer factorization. We will describe how we can implement several cryptographic ECC algorithms in java, such as digital signatures, encryption/decryption and key-exchange. We will show implementation details that would help students, practitioners, and researchers implement and experiment with such algorithms.