From 23ced08d9308cd49f9792c93f8a8c60354942706 Mon Sep 17 00:00:00 2001
From: Daan Sprenkels <hello@dsprenkels.com>
Date: Mon, 19 Aug 2019 16:23:44 +0200
Subject: [PATCH] Add neccessary comma
---
implementation.tex | 3 ++-
1 file changed, 2 insertions(+), 1 deletion(-)
diff --git a/implementation.tex b/implementation.tex
index e855274..1201ebd 100644
--- a/implementation.tex
+++ b/implementation.tex
@@ -24,7 +24,8 @@ The table lookup is implemented in a traditional scanning fashion:
selecting the required value using a bitwise AND operation.
Where we use an unsigned representation,
we compute the conditional negation of $Y$
-by negating $Y$ and selecting the correct result using bitwise operations. When the representation is signed we use a single XOR operation to conditionally flip the sign bit.
+by negating $Y$ and selecting the correct result using bitwise operations. When the representation is signed,
+we use a single XOR operation to conditionally flip the sign bit.
These operations are---as well as the rest of the code---implemented in constant-time.
\begin{algorithm}
--
GitLab