generic-library/openssl
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

BN_mod_sqrt documentation/comment

Browse Source
This commit is contained in:
Bodo Möller 2000-12-06 21:33:58 +00:00
parent f27b45d237
commit aa66eba7c8
2 changed files with 4 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
CHANGES
View File

@ -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

2
crypto/bn/bn_sqrt.c
View File

@ -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;