diff options
| author | Pavel V. Shatov (Meister) <meisterpaul1@yandex.ru> | 2018-10-15 16:03:16 +0300 |
|---|---|---|
| committer | Pavel V. Shatov (Meister) <meisterpaul1@yandex.ru> | 2018-10-15 16:03:16 +0300 |
| commit | d62b3ee93671d81bfd2adafb600759aa7c7f8a56 (patch) | |
| tree | 0eb90c25773f8f9a29b5ccd7dc1f1dd6449bc1e5 /curve25519 | |
| parent | 266984f6cb40b79e924eb31a48f055484b5626e2 (diff) | |
Tiny cleanup.
Diffstat (limited to 'curve25519')
| -rw-r--r-- | curve25519/curve25519_fpga_modular.cpp | 5 |
1 files 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) |