summaryrefslogtreecommitdiff
path: root/bip-0340.mediawiki
diff options
context:
space:
mode:
authorPieter Wuille <pieter.wuille@gmail.com>2020-04-02 16:34:24 -0700
committerGitHub <noreply@github.com>2020-04-02 16:34:24 -0700
commit038615b7c7eb44d47c41261565ef54cdbc1d9f05 (patch)
treea220f40bd9543f26a584197eda9f494e09289806 /bip-0340.mediawiki
parent39ba507e01cbae43ff32f1f3c993c74719b18873 (diff)
parent72657270d8e4d6ef193878f1e743301edfae0e31 (diff)
downloadbips-038615b7c7eb44d47c41261565ef54cdbc1d9f05.tar.xz
Merge pull request #200 from real-or-random/prints
Add debug print for intermediate values
Diffstat (limited to 'bip-0340.mediawiki')
-rw-r--r--bip-0340.mediawiki6
1 files changed, 3 insertions, 3 deletions
diff --git a/bip-0340.mediawiki b/bip-0340.mediawiki
index 883ef3a..b4e5f60 100644
--- a/bip-0340.mediawiki
+++ b/bip-0340.mediawiki
@@ -136,9 +136,9 @@ Input:
* The secret key ''sk'': a 32-byte array, freshly generated uniformly at random
The algorithm ''PubKey(sk)'' is defined as:
-* Let ''d = int(sk)''.
-* Fail if ''d = 0'' or ''d &ge; n''.
-* Return ''bytes(d⋅G)''.
+* Let ''d' = int(sk)''.
+* Fail if ''d' = 0'' or ''d' &ge; n''.
+* Return ''bytes(d'⋅G)''.
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.