diff options
| author | Jack Lloyd <[email protected]> | 2018-03-11 06:49:05 -0400 |
|---|---|---|
| committer | Jack Lloyd <[email protected]> | 2018-03-11 06:49:05 -0400 |
| commit | 67bff936c1b44baf534007cb210a86dff0690a0f (patch) | |
| tree | edb7bf4db85ccb16e121c2876c3d5266c225b5a7 | |
| parent | 69f3cf822bf53dd53f6c8b8f36cef226b973609d (diff) | |
Remove bogus comment
GH #500
| -rw-r--r-- | src/lib/misc/fpe_fe1/fpe_fe1.cpp | 3 |
1 files changed, 0 insertions, 3 deletions
diff --git a/src/lib/misc/fpe_fe1/fpe_fe1.cpp b/src/lib/misc/fpe_fe1/fpe_fe1.cpp index 0ec36363f..8cd79401c 100644 --- a/src/lib/misc/fpe_fe1/fpe_fe1.cpp +++ b/src/lib/misc/fpe_fe1/fpe_fe1.cpp @@ -22,9 +22,6 @@ const size_t MAX_N_BYTES = 128/8; * Factor n into a and b which are as close together as possible. * Assumes n is composed mostly of small factors which is the case for * typical uses of FPE (typically, n is a power of 10) -* -* Want a >= b since the safe number of rounds is 2+log_a(b); if a >= b -* then this is always 3 */ void factor(BigInt n, BigInt& a, BigInt& b) { |