[Cryptech-Commits] [user/shatov/curve25519_fpga_model] 02/04: Tiny cleanup.

[git at cryptech.is]

This is an automated email from the git hooks/post-receive script.

meisterpaul1 at yandex.ru pushed a commit to branch master
in repository user/shatov/curve25519_fpga_model.

commit d62b3ee93671d81bfd2adafb600759aa7c7f8a56
Author: Pavel V. Shatov (Meister) <meisterpaul1 at yandex.ru>
AuthorDate: Mon Oct 15 16:03:16 2018 +0300

    Tiny cleanup.
---
 curve25519/curve25519_fpga_modular.cpp | 5 ++---
 1 file changed, 2 insertions(+), 3 deletions(-)

diff --git a/curve25519/curve25519_fpga_modular.cpp b/curve25519/curve25519_fpga_modular.cpp
index 7ceb3d2..4b075cb 100644
--- a/curve25519/curve25519_fpga_modular.cpp
+++ b/curve25519/curve25519_fpga_modular.cpp
@@ -279,7 +279,7 @@ void fpga_modular_mul_helper_reduce(const FPGA_WORD *C, FPGA_BUFFER *P, const FP
 		 * S1 = P_LO + (P_HI << 5) + (P_HI << 2) + (P_HI << 1)
 		 */
 
-		/* for every word we need to calculate a sum of five values: three
+		/* For every word we need to calculate a sum of five values: three
 		 * shifted copies of P_HI[w], P_LO[w] and carry from the previous word.
 		 * This is done using four adders in a pipelined fashion.
 		 */
@@ -377,7 +377,7 @@ void fpga_modular_mul_helper_reduce(const FPGA_WORD *C, FPGA_BUFFER *P, const FP
 		// copy result to output buffer
 	for (w=0; w<FPGA_OPERAND_NUM_WORDS; w++)
 	{
-			// if subtraction of the highest words produced carry, we ended up
+			// if subtraction of the highest words produced borrow, we ended up
 			// with a negative number and S2 must be returned, not S2_N
 		P->words[w] = b_out ? S2[w] : S2_N[w];
 	}
@@ -452,7 +452,6 @@ void fpga_modular_mul_helper_multiply(const FPGA_BUFFER *A, const FPGA_BUFFER *B
 				// ...accumulate
 			mac[x] += p;
 		}
-
 	}
 
 		// now finally save lower half of SI[] (2*OPERAND_NUM_WORDS words at once)