Does the author (MICHAEL KAPILKOV) not understand the details of his own article, is it just another poorly written article, is it clickbait, all of the above or what am I missing??? secp256k1 is used for private keys, not secp256r1. The article says at one part, "One of the world’s top cryptographers believes that Satoshi Nakamoto chose Bitcoin’s (BTC) elliptic curve either for its efficiency or because it may offer a secret backdoor." Yet further on, the article quotes the same top cryptographer to say, "In contrast, the Koblitz curve parameters are mathematically determined, and there is little possibility for setting such a backdoor.”" Finally, Cointelegraph quotes Wladimir van der Laan to say, "Even if Secp256r1 has a vulnerability, no one has stepped forward yet to announce their discovery. On the other hand, keeping this discovery to themselves could yield a multi-billion dollar reward." secp256r1 vulnerability leads to a multi-billion dollar reward? Where is secp256r1 in bitcoin? There is much room for improvement in this article if I am not missing anything.
ECDSA: How does Bitcoin "chooses" the Elliptic Curve point?
Recently I've read about point addition in elliptic curves and the ECDSA and became curious about how it is applied in the bitcoin code. I've learned that the main idea is, given a point P in the elliptic curve, the relation is: X = xP, where x is the 256-bit integer number Private Key and X is the Public Key. So, my questions are: 1 - How is the point P "chosen"? Is it the same everytime? Or is it randomized? 2 - How is X format defined? Do you just concatenate the x and y coordinates of P?
This Researcher Says Bitcoin’s Elliptic Curve Could Have a Secret Backdoor
One of the world’s top cryptographers believes that Satoshi Nakamoto chose Bitcoin’s (BTC) elliptic curve either for its efficiency or because it may offer a secret backdoor. Elliptic curve is worth $ billions A Bitcoin public key is created by applying elliptic curve cryptography to the private key. One can easily create a public key […]
IBM warns of “instant breaking of encryption” by Quantum Computing in 5 years. As a priority, Bitcoin should seriously plan to move off Elliptic Curve now. Bitcoin will be one of the first to be attacked.
Anyone else interested in bitcoin? I implemented a large chunk of its technology in C. Includes base58 and base32 encoding, an implementation of the elliptic curve encryption algorithm, node intercommunication, and some other things. Take a look and let me know what you think.
MimbleWimble offers privacy by default, more fungibility and better scale-ability of #bitcoin. Since it doesn't support scripts, it would likely be implemented as a sidechain. It is also tied to Elliptic Curve Cryptography and is not well prepared for quantum computing ... yet.
Elliptic Curve Digital Signature Algorithm or ECDSA is a cryptographic algorithm used by Bitcoin to ensure that funds can only be spent by their rightful owners.. A few concepts related to ECDSA: private key: A secret number, known only to the person that generated it.A private key is essentially a randomly generated number. ECDSA (‘Elliptical Curve Digital Signature Algorithm’) is the cryptography behind private and public keys used in Bitcoin. It consists of combining the math behind finite fields and elliptic Elliptic Curve Cryptography¶ This module offer cryptographic primitives based on Elliptic Curves. In particular it provides key generation and validation, signing, and verifying, for the following curves: secp160r1. secp192r1 (NISTP192) secp224r1 (NISTP224) secp256r1 (NISTP256) secp256k1 (used by Bitcoin) For an awesome introduction to ECC Descrtiption  Key and signature-size comparison to DSA . As with elliptic-curve cryptography in general, the bit size of the public key believed to be needed for ECDSA is about twice the size of the security level, in bits. For example, at a security level of 80 bits (meaning an attacker requires a maximum of about 2 80 operations to find the private key) the size of an ECDSA public key Recently I've read about point addition in elliptic curves and the ECDSA and became curious about how it is applied in the bitcoin code. I've learned that the main idea is, given a point P in the elliptic curve, the relation is: X = xP, where x is the 256-bit integer number Private Key and X is the Public Key. So, my questions are:
"Elliptic Curve Cryptography, the Foundation of Bitcoin" by Matt Whitlock - Bitcoin Summit
Bitcoin 101 - Elliptic Curve Cryptography - Part 4 - Generating the Public Key (in Python) - Duration: 21:22. CRI 24,686 views. 21:22. Best Methods to Build Rapport - Anthony Robbins - Duration ... http://bitcoin.org l On December 15, 2012, activist group Truth, Freedom, Prosperity hosted the East Coast Bitcoin Summit at Underground Arts in Philadelphia... Bitcoin 101 Elliptic Curve Cryptography Part 5 The Magic of Signing & Verifying Fabio Carpi. ... Elliptic Curve Cryptography, A very brief and superficial introduction - Duration: 48:42. Bitcoin 101 - Elliptic Curve Cryptography - Part 4 - Generating the Public Key (in Python) - Duration: 21:22. CRI 26,083 views. 21:22. How does a blockchain work - Simply Explained - Duration: 6 ... Bitcoin 101 - Elliptic Curve Cryptography - Part 5 - The Magic of Signing & Verifying - Duration: 19:33. CRI 11,607 views. 19:33. Lecture 16: Introduction to Elliptic Curves by Christof Paar - ...