# Private Keys, Public Keys, and Digital Signatures in Bitcoin — VegaX Research Report

--

The previous installment of the Bitcoin Education Series covered topics pertinent to the success and security of the network. In particular, hashrate and its significance to the network. The piece further touched on potential centralization vectors that could undermine bitcoin’s robustness. Although these topics are essential to keep in mind, as they have far-reaching implications, without a clear understanding of bitcoin’s fundamentals, high-level considerations are not useful.

In this installment, we will “get back to basics,” as the saying goes, and expand upon the concepts of digital signatures, and private and public key pairs, as previously discussed some weeks ago.

Before we dive into the applications of these concepts in the bitcoin network, some history of the genesis of public and private key cryptography. Generally speaking, Public Key Cryptography is a system of encryption that utilizes a public and private key pair in order to encrypt (public) and decrypt (private) messages that one peer sends to another. The beauty of this system is that the public key can be known to all participants on the network, but without a mathematical decryption mechanism (private key / digital signature), messages are safely encrypted and are only parsable by the intended recipient.

The system can otherwise be referred to as one-way authentication or asymmetric cryptography. Public Key cryptography was developed in 1976 by Marin Hellman, Ralph Merkle, and Whitfield Diffie. The three men met at Stanford University and were attempting to devise a more secure solution than private key cryptography — wherein two peers both possess private keys. A drawback in private key cryptography is that if one of the keys falls into the wrong hands, the encryption can be broken. Basically, by reducing the number of private keys (to one) and introducing the concept of publicly known keys, public key cryptography radically increases the security of encryption.

Now that we have some historical context, let’s examine the implementation of public key cryptography in bitcoin. This piece will cover:

- What a private key “is”, and how it is derived.
- What a public key “is” and the mathematical functions associated with it.
- The importance of the elliptic curve in public key cryptography.
- What constitutes a digital signature, and how they are utilized in bitcoin.

# Large, Random Numbers

The simplest definition of a private key is that it is a large, random number. In the bitcoin network, it is a 256-bit number — this is because bitcoin utilizes the SHA-256 hashing algorithm. It is also worth noting that 256-bit numbers can be represented in a variety of formats; binary, for example, is likely familiar to most readers — 0101001011010. A surprising amount of data can be expressed in two characters. There is also the decimal format (e.g. 18061531356) and the hexadecimal format (e.g. ef235aacf90d9f4aadd8) — bitcoin utilizes hexadecimal to represent data in the system.

Circling back to 256-bit numbers: all that a 256-bit number *is*, is a number that can be stored inside 256 bits of data — where a *bit* is the smallest unit of data inside a computer. A bit is capable of storing only values of “0” or “1”, however, bits can be used to represent everyday numbers. For example, the number five, stored in a bit would look like this: 101. In any case, a 256-bit number is represented by using — at most — 256 of these bits, and the total amount of 256-bit numbers is equal to 2256.

Let’s now expand the discussion of 256-bit numbers into the context of the bitcoin network. As previously mentioned, a private key is a randomly generated, 256-bit number. A private key can be generated by flipping a coin 256 times (binary format), using one’s favorite programming language to generate the number (decimal), or running a piece of data through the SHA-256 hashing function (hexadecimal). All of these generation strategies will work, so long as one is able to ensure that the output is *actually random*. If a nefarious actor is familiar with the pattern or generator used to create the random number, the private key is potentially exploitable — and in that case, any bitcoin locked to an address associated with that private key is at risk of being stolen.

When in doubt, flipping a coin 256 times is a serviceable approach, as it is highly unlikely that anyone would get the *exact same* results from running a similar process. The fact that anyone can create their own “bitcoin account” by generating a random number (private key) is a fantastic feature of the protocol. Essentially, this feature democratizes bitcoin, in the sense that there are no central authorities in charge of issuing new accounts. Plus, since there are 2256 possible iterations of private keys, taking the time to randomly generate one provides users with a robust amount of security from the onset.

# Maths and Graphs

A public key is similarly represented as a large, 256-bit number in the hexadecimal format. However, a public key is actually *made from* a private key. This is done by inserting the private key into a mathematical function, specifically, the elliptic curve as represented by the equation y2 = x3 + ax + 7 (where a = 0), and the following image:

The visual representation will allow for a better description of the process by which public keys are made from private keys. The mathematical function is called elliptic curve multiplication, but this term is slightly misleading, as it is not multiplication in the sense that most readers will have learned. Elliptic curve multiplication is a process more akin to “bouncing around the curve” on the graph shown to the left until reaching a final coordinate — the numbers associated with this coordinate represent the public key.

The graph to the right of the text approximates the process previously described. First, we would “multiply” point #1 by our private key: bouncing around the curve — shown to the right as taking the intersection point of the tangent line. Finally, we would take the inverse point on the curve from point #2 — #3, thus we would have our public key.

Specifically, we would have an (x,y) coordinate of our public key — this would be represented by the x and y coordinates put together in hexadecimal format.

Our public key, represented by a hexadecimal can be further optimized. In the current iteration of the bitcoin network, so-called compressed public keys are more commonly used as a space-saving tool. This is because the elliptic curve is based on a bivariate equation, meaning that if you have a value for one variable — x, in this case — you can solve for the other.

Recall, however, that in our equation y2 = x3 + ax + 7, y is squared, meaning that its value could be positive or negative. Due to the way that elliptic curves work, if y is even, the coordinate is *above* the x-axis, whereas an odd y-value means that the coordinate is *below* the x-axis. In bitcoin, compressed public keys are composed of a prepending value, 02 or 03, denoting whether the y value is even or odd, respectively, plus the full x coordinate. Bitcoin developer Greg Walker puts it this way “[it] seems like a lot of effort for a little less text, but because public keys are used within transaction data, it does end up saving a lot of space in the blockchain over time.”

# Why the Elliptic Curve?

Fundamentally, this particular mathematical function has two distinct qualities that make it suitable for private/public key pairing. First, elliptic curve multiplication is a *trapdoor function*, meaning that it is incredibly difficult to “go backwards” — i.e. divide the coordinates of the public key in order to find the private key. Said another way, a trapdoor function is a function that is easy to compute in one direction, yet difficult to compute in the opposite direction (finding its inverse) without special information, called the “trapdoor.”

The second property is that the public key is still mathematically connected to the private key, and as a result, one can prove ownership of the private key without actually revealing it. This is especially important for the bitcoin network; when making transactions, public keys are used in the transaction data *and *one must prove that they do indeed control the private key associated with the public key.

Readers may be curious as to how this proof functions. There is a mathematical connection between the private and public key pair, therefore, the private key can be put through the elliptic curve function and return a *new value*. The public key can be put through the elliptic curve function and return *another new value.* These two values will have a small amount of overlap, that overlap is enough to prove the connection between the public and private key pair. In the next section, we will expand further into the concept of digital signatures and how they simplify the verification of ownership even further.

# Sign on the Dotted Line

Again, similar to a public key, a digital signature (in bitcoin) is a large number, represented in hexadecimal format, that is used to prove ownership of a private key. Advantageously though, the proof of ownership does not necessitate that one reveals their private key. As with the other facets of public and private key pairs, a little math is all that is necessary to prove the connection between the digital signature and the public key.

A digital signature has two components: a random portion, and a signature portion. The first (random) portion is created by generating a random number and multiplying it with the generator point on the elliptic curve — that same point used to generate our public key in the Maths and Graphs section of this piece. The random portion of our digital signature will be the coordinates of the point at which we end up, let’s call that point “r” for short. The second portion is the signature, we will take our private key and multiply it with our random point “r.” The next step is to include *the thing we want to sign* — this is called the message.

In bitcoin, the message is the hash of the entire transaction data, which contains the output we wish to unlock and spend in the particular transaction. Including a transaction hash ties the signature to one *specific* transaction so that it cannot be re-used (or tampered with at some point in the future). Finally, we divide our product [ (r * private key) + message ] by the same random number that we started with. Thus, we have our signature portion, which we will call “s” for short. Now, if someone asks us to prove that we control a private key for a particular public key, we can give them our digital signature (r,s) as proof. Note that in a future edition of the Bitcoin Educational Series, we will expand upon the specifics of that verification process.

## Why does bitcoin use digital signatures?

The answer to this question relates back to a previous installment; recall that when constructing a bitcoin transaction, all UTXOs intended to be inputs must be unlocked. This is accomplished by proving that one “owns” the UTXO, which is itself accomplished by demonstrating knowledge of the private key that the output is locked to. But, simply inputting a private key into a transaction reveals it to the entire network — and if a malicious entity were to gain knowledge of a private key, they would be able to unlock *any other UTXOs that were locked to that address.* This is where digital signatures come in: they allow us to demonstrate ownership of a private key, without revealing the key itself.

## Could someone re-use a signature to unlock other outputs at my address?

Recall that each digital signature contains within it the *specific transaction hash* for which it is signing. Because the original transaction data is used in the construction of the digital signature, it can be thought of as a one-use piece of cryptography. If someone attempted to re-use the signature to sign for another transaction, the transaction data within the signature would *conflict *with the transaction data that it is intended to sign for. Nodes along the network will immediately recognize this discrepancy and reject the transaction. Because each digital signature contains the specific transaction hash, it protects against the possibility of someone retroactively tampering with the transaction.

# Conclusions

Breakthroughs in cryptography made by a handful of young men in Northern California in the 1970’s have provided mankind with the capability to push the boundaries of what money is, and can be. Where there were initially weaknesses in private key cryptography, a more secure public key system was developed. And, in this analyst’s opinion, that development is no anomaly.

Whether it be a digital signature to scalably and securely prove ownership of a private key, or something else, humans continue to innovate. The purpose of this particular piece is not to suggest that these innovations came *out *of bitcoin — as this is clearly not the case. The purpose is to highlight the intricate details and fundamental processes which bitcoin is built *upon*.

At VegaX, we believe that in order to fully grasp the value proposition that investing in bitcoin offers, one must take the time to understand the fundamental elements from which it came. We will continue to create more educational content to further that understanding.

Thank you for reading, we hope you found this piece valuable!

# 🚀Better Indexes, Better Returns — VegaX

# Questions? 👉🏼 info@vegaxholdings.com

# 🎯Follow, Message, Tweet, Clap, & Join Us Here:

As we continue to expand our digital footprint, here is where you can find us:

# VegaX Site | VegaX Twitter | VegaX FB | VegaX LinkedIn | VegaX IG

VegaX Holdings creates next-generation indices and financial products that are needed to support the growth of the cryptocurrency industry and improve returns for investors worldwide. Learn how to get better returns today: www.VegaXHoldings.com