# ecdhe

Published articles for ecdhe.

This is one page of public article previews, not the complete archive. Follow Next page to continue. Summaries are not the original full articles.

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

## Elliptic Curve Cryptography: ECDH and ECDSA

DevFeed: [Elliptic Curve Cryptography: ECDH and ECDSA](<https://devfeed.tech/articles/elliptic-curve-cryptography-ecdh-and-ecdsa-27103.md>)

Original publisher: [Read original article](<https://andrea.corbellini.name/2015/05/30/elliptic-curve-cryptography-ecdh-and-ecdsa/>)

Author: andreacorbellini

Published: 2015-05-30T19:23:00Z

Content type: tutorial

Language: en

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

Topics: [Cryptography](<https://devfeed.tech/topics/cryptography.md>), [ECDSA](<https://devfeed.tech/topics/ecdsa.md>), [math](<https://devfeed.tech/topics/math.md>), [Security, Privacy and Abuse Prevention](<https://devfeed.tech/topics/security-privacy-and-abuse-prevention.md>)

Tags: [algorithms](<https://devfeed.tech/tags/algorithms.md>), [attacks](<https://devfeed.tech/tags/attacks.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>), [math](<https://devfeed.tech/tags/math.md>), [parameter](<https://devfeed.tech/tags/parameter.md>), [points](<https://devfeed.tech/tags/points.md>), [random](<https://devfeed.tech/tags/random.md>), [security](<https://devfeed.tech/tags/security.md>), [smart](<https://devfeed.tech/tags/smart.md>), [tls](<https://devfeed.tech/tags/tls.md>)

### AI overview

This tutorial applies elliptic-curve mathematics over finite fields to cryptography, introducing domain parameters and explaining how random seeds can generate curve parameters or base points. It also discusses weak curves and Smart's attack on the discrete logarithm problem.

### Source excerpt

This post is the third in the series ECC: a gentle introduction. In the previous posts, we have seen what an elliptic curve is and we have defined a group law in order to do some math with the points of elliptic curves. Then we have restricted elliptic curves to finite fields of integers modulo a prime. With this restriction, we have seen that ...