提交 ff612904 编写于 作者: B Bodo Möller

Comment

上级 429cf462
......@@ -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
* in Algebraic Computational Number Theory", algorithm 1.5.1).
* '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;
......
Markdown is supported
0% .
You are about to add 0 people to the discussion. Proceed with caution.
先完成此消息的编辑!
想要评论请 注册