Mention existence of O(n^1.5) squaring algorithm

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)
    {