ECC starting from the basics.
If you can understand what mod means,
if you can understand graphing points,
if you can understand arithmetic,
if you can understand logarithms,
You can understand ECC. Maybe you'll even get to see how they're modular forms..
and what a modular form is.
I will walk through it from start to finish. I'll start by listing the prerequisites to ECC. There aren't many. A novice can understand.
Logarithms
All a logarithm is, is calculating n in picture 2, where b and x are given. The following articles and the 2nd picture should clarify.
https://www.mathsisfun.com/algebra/logarithms.html
https://simple.wikipedia.org/wiki/Logarithm
The Discrete Logarithm Problem
So now that we have established what a logarithm is, then we can understand this easily. The Discrete Logarithm Problem (DLP) is the problem of calculating n in bⁿ = x, where we know b and x. Aside from certain cases (which do not apply to where you encounter them in cryptography), there is no known efficient method for computing this.
Diffie-Helmann
https://youtube.com/watch?v=YEBfamv-_do
https://youtube.com/watch?v=ESPT_36pUFc
https://youtube.com/watch?v=Yjrfm_oRO0w
These videos and picture 3 should clarify how the Diffie-Helmann cryptosystem uses the DLP to encrypt, decrypt and sign messages.
Galois Fields
Will be explained in the next posts.
EC Arithmetic
Will be explained in the next posts.