Thumbs up. I watched 4 videos about ecc now and this is the first one that metioned why it is harder to crack nP than calculating it. To be able to reduce 10P to only 4 operations is the only reason why this stuff works but nobody else mentioned it. Not even Computerphile.
One of the best explanations ever .. I would really appreciate it if you could make another video talking in details about the points addition and how it works with some examples if possible .. Thanks in advance 👍
I remember doing these equations in high school. Many people take advance math in school and people say why are we learning this, I never understood why people question the practicality of math to every day life.
Thanks for the video. I only made it to 6:03 Then my brain threw a null reference error after a stackoverflow error watching it over and over. Rebooting
Thank you for the very good video. But it takes 256 steps to compute P, not 510. Let see on simpler example: 8*P = 2 ^3 * P. Steps: 1) P+P = 2P 2) 2P+ 2P = 4P 3) 4P + 4P = 8P. 3 steps. The same to the key with 255, which has a max value equal to (2^256 - 1)
There's sort of a "local minimum" when counting steps/additions to calculate a power of 2 times P. But say we want 7P instead of 8P, it would actually require more steps. P+P, 2P+2P, 4P+2P then 6P+P which would be 4 steps/additions. So yup although the max 256 bit number can be done in 256 steps, values slightly smaller than that max are expected to need more steps :)
8 is 1000 in binary. So you calculate the sum required to calculate the '1' bit. That is 3 steps. Now what happens if you want to calculate 1001 (9)? You'd need another addition. And to calculate 1111 (15) you'd need 3 additions for a total of 6 operations. So for a 4 bit number, you need at most (4-1) operations to calculate the power of two sums (2p, 4p, 8p), then at most (4-1) additional operations to sum these together. For 256 you'd need (256-1) plus (256-1) or 510
At 9:31 you said division doesn't exist in elliptic curve cryptography. But I haven't found any property that says the statement. Did you mean "extremely difficult" to divide of "impossible". Because in mathematics impossible and extremely difficult are not two same things. You might say the calculation is extremely hard because of some astronomically large numbers, but you can't simply say division doesn't exist because of that. Division doesn't exist if it's related to infinite. Example:- something divided by 0 doesn't exist. Simply because the calculation is beyond human ability, doesn't means it doesn't exist mathematically. Mathematics doesn't care what human can do or cannot. Please clarify if "division doesn't exise" or "extremely hard". Please reply. Thank you.
Beatiful video I was looking for something like this, I love math behind bitcoin ann in algorithms as well, nice information already subscribe and thumps up my friend.
My 2 cents on this - If there is any error in the explanation below, more knowledgeable people are welcome to correct any GLARING mistakes. 1) You generate a random 256 bit number - let's say 1532 (it would be MUCH MUCH larger in real world cases) 2) You take a standard elliptic curve (say secp256k1) which has a standard starting point called P 3) You "add" P to itself 1532 times (Private Key number) using the logic mentioned (tangent and then drop a perpendicular to the curve to get 2P and so on). This will end up at a point (X,Y) on the curve finally. 4) the Y co-ordinate of the end point IS the PUBLIC KEY.
Nice explanation, does anyone have a more in depth video showing how base58 is involved and possibly an example of a private key being hashed into a public key and address?
Extremely simple. Yes I am I guess. That all made very little sense to me. I did gather that hacking the private key from the public key is all but impossible. This is a good thing indeed.
Very good video I dont understand that kind of math. But I remember failing in it miserably in school. But for people who say bitcoin is a scam and can't have any value. At the very least I can show them the mathematical equation that makes it work. Thanks for your great videos
Can someone tell me the sentence he says at 5:40? I can't hear what he's saying...can't make it out. Is he saying "Then you reflect the 3rd point occurs (across on) the x axis"?
the final step wasn't clear. how does signing work? how is something signed and what is the maths to show that i must be in possession of the private key.
How does this video relate to Bitcoin? It explains how the key is encrypted?? Also there is a back door to buying BC? If so how would that be an advantage to someone?
IN laymans terms this is how difficult it would be to hack a private key. Say you had an analog coin with a 1 on one side and a 0 on the other and then flipped it 256 times . You'd have to duplicate the results of those flips exactly to hack bitcoin. ( 0110011100101000111011001010101001100101101010010011000101010101010000100101 and so on) Hence the sha-256 secure hash algorithm.
good video but, you made a mistake. you can't send bitcoin to someone address. You send bitcoin to the blockchain and you put a condition to make this bitcoin available to the first person who meet this condition. One of the condition you can make and witch is used the most is "prove me you have the private key of this adress".
Well i dont know about crypto stuff but certainly I know the definition of tangent you have is wrong. What is the equation of tangent to y=x^3 ast x=0? Does the tangent line only 'touch' the curve at (0,0)?
Isn't it possible that whoever created sha256 also created an equation that can find the private key by plugging in the values of the public key since it follows a predictable pattern?
As far as i am understanding this, this is just the generation of the keypair. But how do prove someone that you are in possesion of teh private key, without giving it away? With RSA you are encrypting a Hash Value with hash^private key mod N. If someone wants to check your public key, they just have to decrypt the encrypted Hash with the public key and they get the original hash value. How does the process work with elliptic curves?
I don't get why xP doesn't take 256 steps instead of 510? Given that 2P (2^1) -> 1 step; 4P (2^2) -> 2 steps; 8P -> (2^3) -> 3 steps; 16P (2^4) -> 4 steps... big number xP (2^256) -> 256 steps? Why 510? I re-watched the video like 10 times. I'm not understanding this. Can somebody explain more on this please ? I'm sorry if this is obvious. My brain is not working sometimes.
The ECC explanation in this video es awesome but when you show addreses use not valid charscter suach M, the blockchain address are 256 bits numbers in hexadecimal format, only valid character are 0...A..F..
Thanks - very helpful. I don't understand however how you use the private key integer in the elliptic curve, since the elliptic curve computation you mention requires a 2-integer input while the private key is just a 1-integer. Is it that you use the private key as X and assume Y as zero, or vice versa?
no, all programmer like this youtuber jut elaborate the source code of bitcoin to understanding of flow/process (address, transaction, mining, rewards, etc) the bitcoin
I believe you bitcoin wallet generates a very high random prime number. Put it into the bitcoin formula, then it is hashed. The hash is now your private / secretly key.
Private key is a random integer, you can generate it in your head, or throwing dice. The public key is generated by multiplying the private key with the Generator Point (P) in X = xP
Thumbs up. I watched 4 videos about ecc now and this is the first one that metioned why it is harder to crack nP than calculating it. To be able to reduce 10P to only 4 operations is the only reason why this stuff works but nobody else mentioned it. Not even Computerphile.
One of the best explanations ever .. I would really appreciate it if you could make another video talking in details about the points addition and how it works with some examples if possible .. Thanks in advance 👍
Meth!? Oh, math...
I understood very little but still liked the video, lol
Thanks!
I remember doing these equations in high school. Many people take advance math in school and people say why are we learning this, I never understood why people question the practicality of math to every day life.
Thanks for the video. I only made it to 6:03 Then my brain threw a null reference error after a stackoverflow error watching it over and over. Rebooting
This is my first time to comment on a tutorial.
Man this is very precise explanation. I’m sticking to this channel
This really helped me start to see what’s going on for a class I’m taking. Thanks, Aimstone!
My brain hurts. But you made it hurt much less than Vitalik. I’m now going to impress the F out of my friends. 🤓
What do you mean? There is next to nothing to understand.
this is the first time i actually understood ECC. the first time. thx so much!
For the first time I get a simple and easy to understand explaination
Absolutely first-rate explanation! Thank you so much.
Thank you for the very good video. But it takes 256 steps to compute P, not 510. Let see on simpler example: 8*P = 2 ^3 * P. Steps: 1) P+P = 2P 2) 2P+ 2P = 4P 3) 4P + 4P = 8P. 3 steps. The same to the key with 255, which has a max value equal to (2^256 - 1)
There's sort of a "local minimum" when counting steps/additions to calculate a power of 2 times P. But say we want 7P instead of 8P, it would actually require more steps. P+P, 2P+2P, 4P+2P then 6P+P which would be 4 steps/additions. So yup although the max 256 bit number can be done in 256 steps, values slightly smaller than that max are expected to need more steps :)
@@complexnumbers64 Nice point!
8 is 1000 in binary. So you calculate the sum required to calculate the '1' bit. That is 3 steps. Now what happens if you want to calculate 1001 (9)? You'd need another addition. And to calculate 1111 (15) you'd need 3 additions for a total of 6 operations. So for a 4 bit number, you need at most (4-1) operations to calculate the power of two sums (2p, 4p, 8p), then at most (4-1) additional operations to sum these together. For 256 you'd need (256-1) plus (256-1) or 510
Very good introduction although I am not sure if I understand all, but at least I don’t feel boring watching the video. Thumb up 👍🏻
This is actually great
At 9:31 you said division doesn't exist in elliptic curve cryptography. But I haven't found any property that says the statement. Did you mean "extremely difficult" to divide of "impossible". Because in mathematics impossible and extremely difficult are not two same things. You might say the calculation is extremely hard because of some astronomically large numbers, but you can't simply say division doesn't exist because of that. Division doesn't exist if it's related to infinite. Example:- something divided by 0 doesn't exist. Simply because the calculation is beyond human ability, doesn't means it doesn't exist mathematically. Mathematics doesn't care what human can do or cannot.
Please clarify if "division doesn't exise" or "extremely hard".
Please reply. Thank you.
in ECC math there is no division property. You add points together via point multiplication, but there is no way to go back points
Beatiful video I was looking for something like this, I love math behind bitcoin ann in algorithms as well, nice information already subscribe and thumps up my friend.
The best simple explanation for the BTC system, I have one simple question how some people could generate the private key?
Perfect explanation, but I must say that this is for someone with atleast a basic understanding of graph theory and Algebra.
Thanks for the video
after looking at lattice cryptography for so long, I'm glad to finally understand something
You exlained it well! Thanks a lot!
Great Explanation. Thx.
I like his voice, it sounds fun. the content very easy to understand thankyou so much.
I STILL can't grasp this. But never mind - thank you for trying to help people like me, who suck at Maths, understand.
Amazing! You deserve a Nobel prize for this wonderful explanation! You got a subscriber with a ton of thanks!
Im 42 yr. Old 8th grade mathematics guy. I understood it perfectly. Thanks for sharing and making this video.
liar
Nice video, well explained!
I'm reading through Mastering Bitcoin and this was very helpful as supplemental material!
Helps a lot, thx
What would P be in this case? Is it independent of big X?
Very good and easy explanation,well done!!!
Nice vídeo mate
my favourite youtuber
Thanks man!
Wow this was way easier than I thought awesome
I was not prepared for that 😶
Its beautiful
I wish you went into more detail on how the public key is derived from the private key
Yesssssssss
My 2 cents on this - If there is any error in the explanation below, more knowledgeable people are welcome to correct any GLARING mistakes.
1) You generate a random 256 bit number - let's say 1532 (it would be MUCH MUCH larger in real world cases)
2) You take a standard elliptic curve (say secp256k1) which has a standard starting point called P
3) You "add" P to itself 1532 times (Private Key number) using the logic mentioned (tangent and then drop a perpendicular to the curve to get 2P and so on). This will end up at a point (X,Y) on the curve finally.
4) the Y co-ordinate of the end point IS the PUBLIC KEY.
Nice explanation, does anyone have a more in depth video showing how base58 is involved and possibly an example of a private key being hashed into a public key and address?
Extremely simple. Yes I am I guess. That all made very little sense to me. I did gather that hacking the private key from the public key is all but impossible. This is a good thing indeed.
Very good video I dont understand that kind of math. But I remember failing in it miserably in school. But for people who say bitcoin is a scam and can't have any value. At the very least I can show them the mathematical equation that makes it work. Thanks for your great videos
Can someone tell me the sentence he says at 5:40? I can't hear what he's saying...can't make it out. Is he saying "Then you reflect the 3rd point occurs (across on) the x axis"?
Thank you for this.
wow. Great video and nice explanation
like ready the headlines of the news and not the actual article, do not always have the time.
I took College Trig so everything you said was familiar to me
the final step wasn't clear. how does signing work? how is something signed and what is the maths to show that i must be in possession of the private key.
cool
explane
How does this video relate to Bitcoin? It explains how the key is encrypted?? Also there is a back door to buying BC? If so how would that be an advantage to someone?
im trying to understand >> im researching into creating my own blockchain from scratch... send help
IN laymans terms this is how difficult it would be to hack a private key.
Say you had an analog coin with a 1 on one side and a 0 on the other and then flipped it 256 times . You'd have to duplicate the results of those flips exactly to hack bitcoin. ( 0110011100101000111011001010101001100101101010010011000101010101010000100101 and so on) Hence the sha-256 secure hash algorithm.
Not 510 times???
Brilliant video 👍
Why every sentence is a question?
Instead of focusing on his accent you could have listened to the actual content of the video.
Nice video ty learnt me somthn
Bitcoin doesn't use RSA, it uses ECDSA. Both are asymmetric.
For those who say that they will never use high school math in their lives, that's the proof. Brilliant though
good video but, you made a mistake. you can't send bitcoin to someone address. You send bitcoin to the blockchain and you put a condition to make this bitcoin available to the first person who meet this condition. One of the condition you can make and witch is used the most is "prove me you have the private key of this adress".
So it the modular the private key? How many times the line has bounced around the curve? I am pretty lost.
Great math!
Well i dont know about crypto stuff but certainly I know the definition of tangent you have is wrong. What is the equation of tangent to y=x^3 ast x=0? Does the tangent line only 'touch' the curve at (0,0)?
Isn't it possible that whoever created sha256 also created an equation that can find the private key by plugging in the values of the public key since it follows a predictable pattern?
Hi, I have a good maths background (engineering) but you lost me on the P addition and multiplication. Anyway, good video on the topic!
nice video.
Thanks!
wtf my entire life i didnt get the fucking graphs and one random video i got it lol thanks
Sir i cannot understand the point from my book for random k values they give range 1,2,....,p-1....can u explain this
I still cannot understand the equation of point addition, why p+q=R.. ? plz explain this point more if you please
As far as i am understanding this, this is just the generation of the keypair. But how do prove someone that you are in possesion of teh private key, without giving it away?
With RSA you are encrypting a Hash Value with hash^private key mod N. If someone wants to check your public key, they just have to decrypt the encrypted Hash with the public key and they get the original hash value.
How does the process work with elliptic curves?
Really interesting! How can we just Elliptic Curve for personal use in Windows or Linux to encrypt messages/files?
how about excell?
Thanks for the explanation! To go from public key to address is sha256 used to hash the public key?
It uses SHA-256 and RIPEMD160. Bitcoin address = RIPEMD160(SHA-256(public key))
I don't get why xP doesn't take 256 steps instead of 510?
Given that
2P (2^1) -> 1 step;
4P (2^2) -> 2 steps;
8P -> (2^3) -> 3 steps;
16P (2^4) -> 4 steps...
big number xP (2^256) -> 256 steps?
Why 510?
I re-watched the video like 10 times. I'm not understanding this. Can somebody explain more on this please ? I'm sorry if this is obvious. My brain is not working sometimes.
AIon same problem!
Funny how youtubers sometimes nail a certain type of high level cheesy cadence, while still having an accent
I followed most of that -- one thing I don't get... X = xP wouldn't be any good if different x resulted in the same X... how come that doesn't happen?
The ECC explanation in this video es awesome but when you show addreses use not valid charscter suach M, the blockchain address are 256 bits numbers in hexadecimal format, only valid character are 0...A..F..
The Bitcoin addresses used to use Base58 encoding on the resultant public key hash in which 'M' is a valid character
Thanks - very helpful. I don't understand however how you use the private key integer in the elliptic curve, since the elliptic curve computation you mention requires a 2-integer input while the private key is just a 1-integer. Is it that you use the private key as X and assume Y as zero, or vice versa?
The private key is a scalar natural number element not a EC's random point.
So what is P?
Wow
Everything is wrong with this video, but it’s my first intro to the elliptical curve concept.
You’ll always have a special place in my heart.
in X = x P, what is P then ? the message?
It is a standard start point defined for each particular curve such as secp256k1 curve.
"Everyone likes meth right? No?!"
Just a heads up, the square root of 26 is not 5.01
He meant 5.1
I'd rather wait for McCaffe to fart in bitcoins direction that try to figure out this common core.
did Satoshi write all these information on his first report?
no, all programmer like this youtuber jut elaborate the source code of bitcoin to understanding of flow/process (address, transaction, mining, rewards, etc) the bitcoin
In the thumbnail why does bitcoin have only 4 fingers instead of 5?😂
Hi. Is the private key generated using ECDSA? Or only the public key is generated using ECDSA?
I believe you bitcoin wallet generates a very high random prime number. Put it into the bitcoin formula, then it is hashed. The hash is now your private / secretly key.
With this hash you can generate your public key. Hence it can use elliptic curve cryptography to verify that you actually signed the transaction
Private key is a random integer, you can generate it in your head, or throwing dice. The public key is generated by multiplying the private key with the Generator Point (P) in X = xP
Why 7? Is it because it is a lucky number?
i understand it enough so that i wouldnt be able to explain to my friends effectively.
tron and btc will big 2018-2019 momentum market
I stopped watching at "generate public key from private key". That is not how it works.
Everyone likes meth, right? No? Atleast some of us do.
👍
i've lasted till 06:11..!!
I hate math!
Seems complicated.
The way he defined tangent was SO DUMB!