aboutsummaryrefslogtreecommitdiff
path: root/README.md
diff options
context:
space:
mode:
authorRob Austein <sra@hactrn.net>2016-05-12 21:45:04 -0400
committerRob Austein <sra@hactrn.net>2016-05-12 21:45:04 -0400
commita0d2fb9dd44af6315f4373956655bb665f86b774 (patch)
tree3fc0b3fab658fd50dffc9bf5915226286413cf8b /README.md
parente6f53e769aee1b8c08ab9c30ecbe191348817bbd (diff)
parentede0e7d35ecc5cf27c7524aa52e091dec83bcceb (diff)
Merge branch 'master' into rpc
Diffstat (limited to 'README.md')
-rw-r--r--README.md2
1 files changed, 1 insertions, 1 deletions
diff --git a/README.md b/README.md
index d4a387e..85ac9c9 100644
--- a/README.md
+++ b/README.md
@@ -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