Topic: what is elliptic curve multiplication? (Read 214 times)
Of course it is not so easy in real calculations. But they are the same in result. This whole topic involves digging deep into algebra and math behind bitcoin. Namely group theory(cyclic groups with prime order), rings, finite fields, modular arithmetic, public key cryptography and its primitives, elliptic curve cryptography.
101 Blackboard Series on youtube can help explain in real work
try reading python code calculates it is helpful to know easy
from my understand
The first time I see Q=k*G look like some math but actually it is a process calculated a lot
multiply it is a one-way flip very long number over 300 time
https://www.youtube.com/watch?v=iB3HcPgm_FI&list=PLzctEq7iZD-7-DgJM604zsndMapn9ff6q&index=18
https://github.com/wobine/blackboard101/blob/master/EllipticCurvesPart4-PrivateKeyToPublicKey.py
try reading python code calculates it is helpful to know easy
from my understand
The first time I see Q=k*G look like some math but actually it is a process calculated a lot
multiply it is a one-way flip very long number over 300 time
https://www.youtube.com/watch?v=iB3HcPgm_FI&list=PLzctEq7iZD-7-DgJM604zsndMapn9ff6q&index=18
https://github.com/wobine/blackboard101/blob/master/EllipticCurvesPart4-PrivateKeyToPublicKey.py
Here You Can find All the details you need .
https://www.oreilly.com/library/view/mastering-bitcoin/9781491902639/ch04.html
It is better if you use a free version on Github as I shared there. In addition, what you shared is a 1st edition, the 2nd edition is therehttps://www.oreilly.com/library/view/mastering-bitcoin/9781491902639/ch04.html
Two more topics on Elliptic Curve Cryptography from Bitcointalk members.
It's when you multiply a point by a number, aka. repeated addition of the point with itself.
The point is a two-dimensional number with an x & y coordinate just like on graphs. But these points are inside a point group, which means a fixed set of points that may not be numerically next to each other or even in numerically ascending order. The curve characteristic is a very large prime number which represents the number of points are in the group, and any multiplication by numbers which are larger than the characteristic (it is similar to maximum int value, by comparison), "wraps around" just like conventional numbers, and the wrapping around is accomplished by the modulus operation. Therefore, multiplying by p+1 is equivalent to multiplication by 1.
The point is a two-dimensional number with an x & y coordinate just like on graphs. But these points are inside a point group, which means a fixed set of points that may not be numerically next to each other or even in numerically ascending order. The curve characteristic is a very large prime number which represents the number of points are in the group, and any multiplication by numbers which are larger than the characteristic (it is similar to maximum int value, by comparison), "wraps around" just like conventional numbers, and the wrapping around is accomplished by the modulus operation. Therefore, multiplying by p+1 is equivalent to multiplication by 1.
Here You Can find All the details you need .
https://www.oreilly.com/library/view/mastering-bitcoin/9781491902639/ch04.html
Scroll Down And read the "Eliptic curve "
https://www.oreilly.com/library/view/mastering-bitcoin/9781491902639/ch04.html
Scroll Down And read the "Eliptic curve "
Elliptic curve multiplication is not a normal multiplication; it is basically a combination of two operations: point doubling and point addition. This is how it works: you take the generator point G and multiply it by your private key in a binary format. "Mutiply" means you perform point doubling of the result every time you see "0" in your private key, and you perform point addition of the result every time you see "1". For example, you private key is 1010. That means you add G to itself and get 2G, than double it and get 4G, than again add G to 4G and get 5G, than double it again and get 10G. 10G is your public key.
You are free to read the book, Mastering Bitcoin 2nd edition on Github: https://github.com/bitcoinbook/bitcoinbook
- Chapter 4: Key and addresses: Elliptic Curve Cryptography Explained
may anyone introduce me what is elliptic curve multiplication and how it works & why is it so important briefly??
Jump to: