From ff612904d277b6e4f8118913e1278a1afc75e073 Mon Sep 17 00:00:00 2001
From: =?utf8?q?Bodo=20M=C3=B6ller?= <bodo@openssl.org>
Date: Thu, 8 Mar 2001 16:53:30 +0000
Subject: [PATCH] Comment

---
 crypto/bn/bn_sqrt.c | 2 ++
 1 file changed, 2 insertions(+)

diff --git a/crypto/bn/bn_sqrt.c b/crypto/bn/bn_sqrt.c
index 6e70e5c541..e2a1105dc8 100644
--- a/crypto/bn/bn_sqrt.c
+++ b/crypto/bn/bn_sqrt.c
@@ -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;
-- 
2.25.1