diff options
| author | Pieter Wuille <pieter@wuille.net> | 2020-10-14 11:41:15 -0700 |
|---|---|---|
| committer | Pieter Wuille <pieter@wuille.net> | 2020-10-14 11:41:15 -0700 |
| commit | 9e5626d2a8ddbbd7640ff53f89f3a7021d747633 (patch) | |
| tree | 95085289012230285b6cc1bb551ebf8a217121a0 /src/secp256k1/README.md | |
| parent | c2c4dbaebd955ad2829364f7fa5b8169ca1ba6b9 (diff) | |
| parent | 52380bf304b1c02dda23f1e2fad0159e29b2f7a2 (diff) | |
| download | bitcoin-9e5626d2a8ddbbd7640ff53f89f3a7021d747633.tar.xz | |
Update libsecp256k1 subtree to latest master
Diffstat (limited to 'src/secp256k1/README.md')
| -rw-r--r-- | src/secp256k1/README.md | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/src/secp256k1/README.md b/src/secp256k1/README.md index 434178b372..2602475787 100644 --- a/src/secp256k1/README.md +++ b/src/secp256k1/README.md @@ -48,7 +48,7 @@ Implementation details * Use wNAF notation for point multiplicands. * Use a much larger window for multiples of G, using precomputed multiples. * Use Shamir's trick to do the multiplication with the public key and the generator simultaneously. - * Optionally (off by default) use secp256k1's efficiently-computable endomorphism to split the P multiplicand into 2 half-sized ones. + * Use secp256k1's efficiently-computable endomorphism to split the P multiplicand into 2 half-sized ones. * Point multiplication for signing * Use a precomputed table of multiples of powers of 16 multiplied with the generator, so general multiplication becomes a series of additions. * Intended to be completely free of timing sidechannels for secret-key operations (on reasonable hardware/toolchains) |