diff options
| author | Rob Austein <sra@hactrn.net> | 2016-05-12 21:45:04 -0400 |
|---|---|---|
| committer | Rob Austein <sra@hactrn.net> | 2016-05-12 21:45:04 -0400 |
| commit | a0d2fb9dd44af6315f4373956655bb665f86b774 (patch) | |
| tree | 3fc0b3fab658fd50dffc9bf5915226286413cf8b | |
| parent | e6f53e769aee1b8c08ab9c30ecbe191348817bbd (diff) | |
| parent | ede0e7d35ecc5cf27c7524aa52e091dec83bcceb (diff) | |
Merge branch 'master' into rpc
| -rw-r--r-- | README.md | 2 |
1 files changed, 1 insertions, 1 deletions
@@ -80,7 +80,7 @@ The current point addition and point doubling algorithms come from the [EFD][]. At least at the moment, we're only interested in ECDSA with the NIST prime curves, so we use algorithms optimized for a=-3. -The point multiplication algorithm is a straightforward square and add +The point multiplication algorithm is a straightforward double-and-add loop, which is not the fastest possible algorithm, but is relatively easy to confirm by inspection as being constant-time within the limits imposed by the NIST curves. Point multiplication could probably be |