April 18, 2025
Advanced Digital Media Group 2550 S. Rainbow BLVD Las Vegas, NV 89146
blockchain buildbootcamp chain chain of digital signatures cryptographic digital signature cryptographic signatures digital coins digital signature algorithm discrete logarithm double spend problem double spendable coin dsa ecdsa ECDSACoin electronic cash electronic cash explained elliptic curve cryptography justin moon nick szabosh satoshi nakamoto

Electronic cash like bitcoin explained for developers

Electronic cash like bitcoin explained for developers

We use elliptic curve digital signature algorithms to define electronic cash as a chain of digital signatures. This is a compressed version of Justin Moons video “ECDSACoin”. You should really check out Justins content because he has a great approach to teaching the basics of bitcoin. However his videos are almost 50 minutes each and I thought I make a compressed version so that you can decide if you really want to check them out or not!

Justin Moons website: https://buidlbootcamp.com/
Justins Video: https://www.youtube.com/watch?v=hujedHkaxLI />Source Code: https://github.com/superquest/digital-cash/blob/master/ECDSACoin.ipynb

Discrete Logarithm https://www.di-mgt.com.au/public-key-crypto-discrete-logs-0.html
Complexity of solving discrete logs: https://cs.stackexchange.com/questions/2658/how-hard-is-finding-the-discrete-logarithm
Elliptice Curve Cryptography: https://en.wikipedia.org/wiki/Elliptic_Curve_Digital_Signature_Algorithm

I will appreciate the kindness if you leave a (small!) tip.
BTC-address:
1KwjU4UknzbXh1rnP1jAKz9wwjcuYwe9AC
segwit: 38fWwbsxvVeBsJpH4bbHTBai8jT8RUa7DE

Leave an even more anonymous tip via the ⚡ Lightning ⚡ network (: Get the invoice with this curl statement:

curl -i -H “Accept: application/json” -d ‘{“amount”:ENTER_AN_INTEGER_AMOUNT_OF_SATOSHIS_INSTEAD_OF_THIS}’ https://ln.rene-pickhardt.de/invoice

Big thanks to Fulmo from Berlin for supporting some of my work!

My web site: https://www.rene-pickhardt.de and Twitter: https://twitter.com/renepickhardt as well as my lightning node: https://ln.rene-pickhardt.de

      • 6 years ago

      Discrete Logarithm problems are not believed to be NP hard (and thus, not NP complete). However, they are clearly in NP, and so they are certainly not "even harder" than NP complete. Also, there are no proofs that any of this is hard. Proving that NP hard is not the same as polynomial is one of the great unsolved problems in the world (and might even be unprovable), and even proving that wouldn't be enough to prove that Discrete Log problems are hard. So all we have for believing in pretty much all cryptography is that nobody has been able to break any of it in the past few decades.

    Leave feedback about this

    • Quality
    • Price
    • Service

    PROS

    +
    Add Field

    CONS

    +
    Add Field
    Choose Image
    Choose Video