Difference between revisions of "Elliptic Curve Digital Signature Algorithm"
| Line 6: | Line 6: | ||
* [[Protocol#Signatures|signatures]]: A string of bytes proving that a private key was used to sign a message. A signature is mathematically generated from a [[SHA-256|hash]] of the message being signed and a private key. The signature itself is two numbers known as ''r'' and ''s'' and the message being signed is the Bitcoin transaction (minus the signature data). With the public key, a mathematical algorithm (signature verification) can be used on the signature to determine that it was originally produced from the hash and the private key, without needing to know the private key. Signatures are usually 71, 72, or 73 bytes long, with probabilities approximately 25%, 50% and 25% respectively. | * [[Protocol#Signatures|signatures]]: A string of bytes proving that a private key was used to sign a message. A signature is mathematically generated from a [[SHA-256|hash]] of the message being signed and a private key. The signature itself is two numbers known as ''r'' and ''s'' and the message being signed is the Bitcoin transaction (minus the signature data). With the public key, a mathematical algorithm (signature verification) can be used on the signature to determine that it was originally produced from the hash and the private key, without needing to know the private key. Signatures are usually 71, 72, or 73 bytes long, with probabilities approximately 25%, 50% and 25% respectively. | ||
| − | In Bitcoin | + | In Bitcoin, elliptic curve signatures must sign a hash of a "transaction message" which can be reproduced easily by nodes validating the signature during the process of validating transactions. |
| + | The message that is hashed for the signature contains the following elements concatenated into a single string: | ||
| + | # <transaction version> | ||
| + | # Hash(concatenation of input source / sources) (defined by SIGHASH) | ||
| + | # Hash(concatenation of input nSequence value / values) (defined by SIGHASH) | ||
| + | # Outpoint for input being spent (TXID / Vout) | ||
| + | # Locking script for input being spent (defined by OP_CODESEPARATOR) | ||
| + | # Value of input being spent (in satoshis) | ||
| + | # nSequence value for input being spent | ||
| + | # Hash of output / outputs being signed (defined by SIGHASH) | ||
| + | # Transaction nLocktime | ||
| + | # Sighash flag | ||
| + | |||
| + | All signatures include [[SIGHASH flags]] which tell the transaction validator which parts of the message have been used in the construction of the message hash. | ||
==See also== | ==See also== | ||
Revision as of 05:48, 6 November 2020
Elliptic Curve Digital Signature Algorithm or ECDSA is a cryptographic algorithm used by Bitcoin to ensure the effective and secure control of ownership of funds.
A few concepts related to ECDSA:
- private key: A secret number, known only to the person that generated it. A private key can be a randomly generated number but in 2019 most wallets use deterministic key schemes derived from BIP 0032. In Bitcoin, someone who can prove ownership of unspent outputs can use the private key to spend the funds. In Bitcoin, a private key is a single unsigned 256-bit integer (32 bytes).
- public key: A coordinate that corresponds to a private key, but does not need to be kept secret. A public key can be calculated from a private key, but not vice versa. A public key can be used to determine if a signature is genuine by using ECDSA to validate that a signature was generated by the private key that corresponds to the public key that has been proffered, without requiring the private key to be divulged. In Bitcoin, public keys are either compressed or uncompressed. Compressed public keys are 33 bytes, consisting of a prefix either 0x02 or 0x03, and a 256-bit integer called x. Uncompressed keys are 65 bytes, consisting of constant prefix (0x04), followed by two 256-bit integers called x and y (2 * 32 bytes). The prefix of a compressed key allows for the y value to be derived from the x value.
- signatures: A string of bytes proving that a private key was used to sign a message. A signature is mathematically generated from a hash of the message being signed and a private key. The signature itself is two numbers known as r and s and the message being signed is the Bitcoin transaction (minus the signature data). With the public key, a mathematical algorithm (signature verification) can be used on the signature to determine that it was originally produced from the hash and the private key, without needing to know the private key. Signatures are usually 71, 72, or 73 bytes long, with probabilities approximately 25%, 50% and 25% respectively.
In Bitcoin, elliptic curve signatures must sign a hash of a "transaction message" which can be reproduced easily by nodes validating the signature during the process of validating transactions. The message that is hashed for the signature contains the following elements concatenated into a single string:
- <transaction version>
- Hash(concatenation of input source / sources) (defined by SIGHASH)
- Hash(concatenation of input nSequence value / values) (defined by SIGHASH)
- Outpoint for input being spent (TXID / Vout)
- Locking script for input being spent (defined by OP_CODESEPARATOR)
- Value of input being spent (in satoshis)
- nSequence value for input being spent
- Hash of output / outputs being signed (defined by SIGHASH)
- Transaction nLocktime
- Sighash flag
All signatures include SIGHASH flags which tell the transaction validator which parts of the message have been used in the construction of the message hash.
See also
External Links
Attribution
This content is based on content sourced from https://en.bitcoin.it/wiki/Elliptic_Curve_Digital_Signature_Algorithm under Creative Commons Attribution 3.0. Although it may have been extensively revised and updated we acknowledge the original authors.