Faster BN_mod_sqrt algorithm for p == 5 (8).

[openssl.git] / CHANGES

diff --git a/CHANGES b/CHANGES
index 4197e739e1d154f57732d08a6a8d0edfe4e88d9e..ab334b87e1135bc27485f03d5f49cbdb08559edd 100644 (file)
--- a/CHANGES
+++ b/CHANGES
@@ -32,7 +32,7 @@
      [Richard Levitte]
 
   *) New function BN_mod_sqrt for computing square roots modulo a prime
-     (Tonelli-Shanks algorithm).
+     (Tonelli-Shanks algorithm unless  p == 3 (mod 4)  or  p == 5 (mod 8)).
      [Lenka Fibikova <fibikova@exp-math.uni-essen.de>, Bodo Moeller]
 
   *) Store verify_result within SSL_SESSION also for client side to