## Elliptic Curve Cryptography: breaking security and a comparison with RSA

This post is the fourth and last in the series ECC: a gentle introduction.In the last post we have seen two algorithms, ECDH and ECDSA, and we have seen how the discrete logarithm problem for elliptic curves plays an important role for their security. But, if you remember, we said that we have no mathematical proofs for the complexity of the discrete logarithm …