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

DevFeed: [Elliptic Curve Cryptography: breaking security and a comparison with RSA](<https://devfeed.tech/articles/elliptic-curve-cryptography-breaking-security-and-a-comparison-with-rsa-27104.md>)

Original publisher: [Read original article](<https://andrea.corbellini.name/2015/06/08/elliptic-curve-cryptography-breaking-security-and-a-comparison-with-rsa/>)

Author: andreacorbellini

Published: 2015-06-08T13:28:00Z

Content type: article

Language: en

Sources: [Andrea Corbellini](<https://devfeed.tech/sources/andrea-corbellini.md>)

Topics: [Cryptography](<https://devfeed.tech/topics/cryptography.md>), [Algorithms, Complexity](<https://devfeed.tech/topics/algorithms-complexity.md>), [Algorithms](<https://devfeed.tech/topics/algorithms.md>), [ECDSA](<https://devfeed.tech/topics/ecdsa.md>), [Security](<https://devfeed.tech/topics/security.md>)

Tags: [algorithms](<https://devfeed.tech/tags/algorithms.md>), [comparison](<https://devfeed.tech/tags/comparison.md>), [complexity](<https://devfeed.tech/tags/complexity.md>), [cryptography](<https://devfeed.tech/tags/cryptography.md>), [dh](<https://devfeed.tech/tags/dh.md>), [dsa](<https://devfeed.tech/tags/dsa.md>), [ecc](<https://devfeed.tech/tags/ecc.md>), [ecdh](<https://devfeed.tech/tags/ecdh.md>), [ecdhe](<https://devfeed.tech/tags/ecdhe.md>), [ecdsa](<https://devfeed.tech/tags/ecdsa.md>), [hash](<https://devfeed.tech/tags/hash.md>), [introduction](<https://devfeed.tech/tags/introduction.md>), [rsa](<https://devfeed.tech/tags/rsa.md>), [security](<https://devfeed.tech/tags/security.md>), [series](<https://devfeed.tech/tags/series.md>)

## AI overview

This fourth and final post in a series examines how practical techniques attack the elliptic-curve discrete logarithm problem, focusing on baby-step, giant-step and Pollard's rho methods. It then compares the need for elliptic-curve cryptography with RSA-based cryptosystems.

## Source excerpt

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 ...