diff options
| author | lloyd <[email protected]> | 2008-11-10 02:31:37 +0000 |
|---|---|---|
| committer | lloyd <[email protected]> | 2008-11-10 02:31:37 +0000 |
| commit | 032a4574bee834337b8ccf7fc29779c69c161e2b (patch) | |
| tree | 26d6c4c4cc1445b0e051eb44b3ffff102fd03ab5 /src/math/bigint/mulop_generic | |
| parent | d847970d6022b587efd821b82ac37120078107fb (diff) | |
Mention existence of O(n^1.5) squaring algorithm
Diffstat (limited to 'src/math/bigint/mulop_generic')
| -rw-r--r-- | src/math/bigint/mulop_generic/mp_mulop.cpp | 3 |
1 files changed, 3 insertions, 0 deletions
diff --git a/src/math/bigint/mulop_generic/mp_mulop.cpp b/src/math/bigint/mulop_generic/mp_mulop.cpp index 3ab28d306..daa394fe6 100644 --- a/src/math/bigint/mulop_generic/mp_mulop.cpp +++ b/src/math/bigint/mulop_generic/mp_mulop.cpp @@ -45,6 +45,9 @@ This is exactly the same algorithm as bigint_simple_mul, however because C/C++ compilers suck at alias analysis it is good to have the version where the compiler knows that x == y + +There is an O(n^1.5) squaring algorithm specified in Handbook of +Applied Cryptography, chapter 14 *************************************************/ void bigint_simple_sqr(word z[], const word x[], u32bit x_size) { |