diff options
| author | Tim Ruffing <crypto@timruffing.de> | 2020-03-04 21:21:36 +0100 |
|---|---|---|
| committer | Tim Ruffing <crypto@timruffing.de> | 2020-03-12 21:15:52 +0100 |
| commit | a6301c5af08d39121c1e1e7dc9ad1b9e9fe45942 (patch) | |
| tree | a595985c92a1786ea450eff208203fa96b53e4ba /bip-0340.mediawiki | |
| parent | 39ba507e01cbae43ff32f1f3c993c74719b18873 (diff) | |
Optionally print intermediate values in reference code
and make reference code and pseudocode more consistent with each other
Diffstat (limited to 'bip-0340.mediawiki')
| -rw-r--r-- | bip-0340.mediawiki | 6 |
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 ≥ n''. -* Return ''bytes(d⋅G)''. +* Let ''d' = int(sk)''. +* Fail if ''d' = 0'' or ''d' ≥ 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. |