From 632a749ef73ea79509bbc04df9fa52b0ec2784d6 Mon Sep 17 00:00:00 2001 From: "kristen@oreilly.com" Date: Thu, 11 Nov 2021 12:27:17 -0800 Subject: [PATCH] Edited appendix-bitcoin-fundamentals-review.asciidoc with Atlas code editor --- appendix-bitcoin-fundamentals-review.asciidoc | 10 ++++++---- 1 file changed, 6 insertions(+), 4 deletions(-) diff --git a/appendix-bitcoin-fundamentals-review.asciidoc b/appendix-bitcoin-fundamentals-review.asciidoc index b7e7430..09efe32 100644 --- a/appendix-bitcoin-fundamentals-review.asciidoc +++ b/appendix-bitcoin-fundamentals-review.asciidoc @@ -37,11 +37,13 @@ A private key is simply a number, picked at random. In practice, and to make man ((("Bitcoin (system)","public keys")))((("public keys")))Each private key has a corresponding _public key_, which is calculated from the private key, using scalar multiplication on the elliptic curve. In simple terms, with a private key _k_, we can multiply it with a constant _G_ to produce a public key _K_: ----- -_K_ = __k__*__G__ ----- +++++ + +++++ -It is impossible to reverse this calculation. Given a public key +K+, one cannot calculate the private key +k+. Division by +G+ is not possible in elliptic curve math. Instead, one would have to try all possible values of +k+ in an exhaustive process called a _brute-force attack_. Because +k+ is a 256-bit number, exhausting all possible values with any classical computer would require more time and energy than available in this universe. +It is impossible to reverse this calculation. Given a public key _K_, one cannot calculate the private key _k_. Division by _G_ is not possible in elliptic curve math. Instead, one would have to try all possible values of _k_ in an exhaustive process called a _brute-force attack_. Because _k_ is a 256-bit number, exhausting all possible values with any classical computer would require more time and energy than available in this universe. ==== Hashes