Comment
This commit is contained in:
parent
429cf462d0
commit
ff612904d2
@ -65,6 +65,8 @@ BIGNUM *BN_mod_sqrt(BIGNUM *in, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx)
|
|||||||
* using the Tonelli/Shanks algorithm (cf. Henri Cohen, "A Course
|
* using the Tonelli/Shanks algorithm (cf. Henri Cohen, "A Course
|
||||||
* in Algebraic Computational Number Theory", algorithm 1.5.1).
|
* in Algebraic Computational Number Theory", algorithm 1.5.1).
|
||||||
* 'p' must be prime!
|
* 'p' must be prime!
|
||||||
|
* If 'a' is not a square, this is not necessarily detected by
|
||||||
|
* the algorithms; a bogus result must be expected in this case.
|
||||||
*/
|
*/
|
||||||
{
|
{
|
||||||
BIGNUM *ret = in;
|
BIGNUM *ret = in;
|
||||||
|
Loading…
x
Reference in New Issue
Block a user