diff options
| author | Anthony Towns <aj@erisian.com.au> | 2020-02-01 16:53:02 +1000 |
|---|---|---|
| committer | Pieter Wuille <pieter.wuille@gmail.com> | 2020-02-23 19:40:21 -0800 |
| commit | 453947f43ab1d67df777ce6a26c8904a80afe20f (patch) | |
| tree | b693a9245fb0ffb9c614ff7527e8ace26cb985da | |
| parent | 455504b3af46bb39894a11b54fb10edb11528186 (diff) | |
| download | bips-453947f43ab1d67df777ce6a26c8904a80afe20f.tar.xz | |
give bip32 conversion its own section
| -rw-r--r-- | bip-0340.mediawiki | 2 |
1 files changed, 2 insertions, 0 deletions
diff --git a/bip-0340.mediawiki b/bip-0340.mediawiki index 3aa6e05..bd04d69 100644 --- a/bip-0340.mediawiki +++ b/bip-0340.mediawiki @@ -142,6 +142,8 @@ The algorithm ''PubKey(sk)'' is defined as: Note that we use a very different public key format (32 bytes) than the ones used by existing systems (which typically use elliptic curve points as public keys, or 33-byte or 65-byte encodings of them). A side effect is that ''PubKey(sk) = PubKey(bytes(n - int(sk))'', so every public key has two corresponding secret keys. +==== Public Key Conversion ==== + As an alternative to generating keys randomly, it is also possible and safe to repurpose existing key generation algorithms for ECDSA in a compatible way. The secret keys constructed by such an algorithm can be used as ''sk'' directly. The public keys constructed by such an algorithm (assuming they use the 33-byte compressed encoding) need to be converted by dropping the first byte. Specifically, [[bip-0032.mediawiki|BIP32]] and schemes built on top of it remain usable. ==== Default Signing ==== |