Commit aa66eba7 authored by Bodo Möller's avatar Bodo Möller
Browse files

BN_mod_sqrt documentation/comment

parent f27b45d2

CHANGES

+3 −1
Original line number Diff line number Diff line
@@ -32,7 +32,9 @@ 
     [Richard Levitte]



  *) New function BN_mod_sqrt for computing square roots modulo a prime

     (Tonelli-Shanks algorithm unless  p == 3 (mod 4)  or  p == 5 (mod 8)).

     (using the probabilistic Tonelli-Shanks algorithm unless

     p == 3 (mod 4)  or  p == 5 (mod 8),  which are cases that can

     be handled deterministically).

     [Lenka Fibikova <fibikova@exp-math.uni-essen.de>, Bodo Moeller]



  *) Store verify_result within SSL_SESSION also for client side to

crypto/bn/bn_sqrt.c

+1 −1
Original line number Diff line number Diff line
@@ -201,7 +201,7 @@ BIGNUM *BN_mod_sqrt(BIGNUM *in, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx) 


		/* t := (2*a)*b^2 - 1*/

		if (!BN_mod_mul(t, t, y, p, ctx)) goto end;

		if (!BN_sub_word(t, 1)) goto end; /* cannot become negative */

		if (!BN_sub_word(t, 1)) goto end;



		/* x = a*b*t */

		if (!BN_mod_mul(x, a, b, p, ctx)) goto end;