# Elliptic Curve Cryptography: finite fields and discrete logarithms

DevFeed: [Elliptic Curve Cryptography: finite fields and discrete logarithms](<https://devfeed.tech/articles/elliptic-curve-cryptography-finite-fields-and-discrete-logarithms-27102.md>)

Original publisher: [Read original article](<https://andrea.corbellini.name/2015/05/23/elliptic-curve-cryptography-finite-fields-and-discrete-logarithms/>)

Author: andreacorbellini

Published: 2015-05-23T14:08:00Z

Content type: tutorial

Language: en

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

Topics: [Cryptography](<https://devfeed.tech/topics/cryptography.md>), [Algorithms](<https://devfeed.tech/topics/algorithms.md>)

Tags: [algorithm](<https://devfeed.tech/tags/algorithm.md>), [cryptography](<https://devfeed.tech/tags/cryptography.md>), [ecc](<https://devfeed.tech/tags/ecc.md>), [math](<https://devfeed.tech/tags/math.md>), [security](<https://devfeed.tech/tags/security.md>)

## AI overview

A tutorial article on elliptic curve cryptography that introduces finite fields and modular arithmetic, building on prior coverage of elliptic-curve point addition and scalar multiplication.

## Source excerpt

This post is the second in the series ECC: a gentle introduction. In the previous post, we have seen how elliptic curves over the real numbers can be used to define a group. Specifically, we have defined a rule for point addition: given three aligned points, their sum is zero ($P + Q + R = 0$). We have derived a geometric method and an algebraic method ...