From ede0e7d35ecc5cf27c7524aa52e091dec83bcceb Mon Sep 17 00:00:00 2001 From: Rob Austein Date: Thu, 12 May 2016 21:43:14 -0400 Subject: "Double and add" is sort of like "square and muliply", but "square and add" is just a symptom of editing documentation in one's sleep. Feh. --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) 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 -- cgit v1.2.3