This is part two in my basic visual introduction to the concepts behind a blockchain. We build on the concepts from the previous video and introduce public / private key pairs and signing using an interactive web demo.
If you missed it, part 1 is here:
If you are interested in playing with this on your own, it is available online at:
The code that runs this demo is also on GitHub:
If you want to know more about how public key cryptography works, see the Wikipedia page on it:
The details of how public keys relate to private keys are hard to summarize, but it has to do with Euler's theorem. Basically, using Euler's theorem there is some math you can do to a number given some parameters (which I'll call the public key) which allows someone with some other parameters (which I'll call the private key) to decipher the original number without having to do brute force factorization because there is a shortcut way to find the phi of a prime number. Rather than me butchering the explanation, check this video series out for a more detailed explanation:
I'm @anders94 on Twitter and @andersbrownworth on Steemit.
Donations:
BTC: 1K3NvcuZzVTueHW1qhkG2Cm3viRkh2EXJp
ETH: 0x84a90e21d9d02e30ddcea56d618aa75ba90331ff
ETC: 0xab75ad757c89fa33b92090193a797e6700769ef8 #jito crypto #sec bitcoin news #bitcoin info
Blockchain 101 - Part 2 - Public / Private Keys and Signing [oN2iAgt1Saj]
This is part two in my basic visual introduction to the concepts behind a blockchain. We build on the concepts from the previous video and introduce public / private key pairs and signing using an interactive web demo.
If you missed it, part 1 is here:
If you are interested in playing with this on your own, it is available online at:
The code that runs this demo is also on GitHub:
If you want to know more about how public key cryptography works, see the Wikipedia page on it:
The details of how public keys relate to private keys are hard to summarize, but it has to do with Euler's theorem. Basically, using Euler's theorem there is some math you can do to a number given some parameters (which I'll call the public key) which allows someone with some other parameters (which I'll call the private key) to decipher the original number without having to do brute force factorization because there is a shortcut way to find the phi of a prime number. Rather than me butchering the explanation, check this video series out for a more detailed explanation:
I'm @anders94 on Twitter and @andersbrownworth on Steemit.
Donations:
BTC: 1K3NvcuZzVTueHW1qhkG2Cm3viRkh2EXJp
ETH: 0x84a90e21d9d02e30ddcea56d618aa75ba90331ff
ETC: 0xab75ad757c89fa33b92090193a797e6700769ef8 #jito crypto #sec bitcoin news #bitcoin info