From: Mark Wooding <mdw@distorted.org.uk>
Date: Tue, 16 Jan 2024 13:44:58 +0000 (+0000)
Subject: utils/gcm-ref: Fix embarrassing mistakes in comments.
X-Git-Url: https://git.distorted.org.uk/~mdw/catacomb/commitdiff_plain/4e7475c2fc07c8e588583d82d95221d8e6813757

utils/gcm-ref: Fix embarrassing mistakes in comments.

Imagine my head hanging in shame.
---

diff --git a/utils/gcm-ref b/utils/gcm-ref
index bec00d75..bba76602 100755
--- a/utils/gcm-ref
+++ b/utils/gcm-ref
@@ -127,7 +127,7 @@ def table_common(u, v, flip, getword, ixmask):
   """
   Multiply U by V using table lookup; common for `table-b' and `table-l'.
 
-  This matches the `simple_mulk_...' implementation in `gcm.c'.  One-entry
+  This matches the `simple_mulk_...' implementation in `gcm.c'.  One entry
   per bit is the best we can manage if we want a constant-time
   implementation: processing n bits at a time means we need to scan
   (2^n - 1)/n times as much memory.
@@ -140,7 +140,7 @@ def table_common(u, v, flip, getword, ixmask):
       are processed most-significant first.
 
     * IXMASK is a mask XORed into table indices to permute the table so that
-      it's order matches that induced by GETWORD.
+      its order matches that induced by GETWORD.
 
   The table is built such that tab[i XOR IXMASK] = U t^i.
   """