diff --git a/implementation.tex b/implementation.tex
index e855274b0445e44d97c4fa6386c913939715b0b1..1201ebd8c0ef03d735f942ff6c330af7984720b3 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}