From: Matt Caswell <matt@openssl.org>
Date: Mon, 30 Apr 2018 14:05:45 +0000 (+0100)
Subject: Clarify BN_mod_exp docs
X-Git-Tag: OpenSSL_1_0_2p~65
X-Git-Url: https://git.librecmc.org/?a=commitdiff_plain;h=a96022b3c4d159d1b14f54bd6811fd97a52df636;p=oweals%2Fopenssl.git

Clarify BN_mod_exp docs

Specifically this is not supported with an even modulus and
BN_FLG_CONSTTIME.

Fixes #5082

Reviewed-by: Rich Salz <rsalz@openssl.org>
(Merged from https://github.com/openssl/openssl/pull/6138)

(cherry picked from commit 966b3df182b9c8644c154f1c3e686027d37acb05)
---

diff --git a/doc/crypto/BN_add.pod b/doc/crypto/BN_add.pod
index 88c7a799ee..02e5486416 100644
--- a/doc/crypto/BN_add.pod
+++ b/doc/crypto/BN_add.pod
@@ -91,7 +91,9 @@ BN_exp() raises I<a> to the I<p>-th power and places the result in I<r>
 BN_mul().
 
 BN_mod_exp() computes I<a> to the I<p>-th power modulo I<m> (C<r=a^p %
-m>). This function uses less time and space than BN_exp().
+m>). This function uses less time and space than BN_exp(). Do not call this
+function when B<m> is even and any of the parameters have the
+B<BN_FLG_CONSTTIME> flag set.
 
 BN_gcd() computes the greatest common divisor of I<a> and I<b> and
 places the result in I<r>. I<r> may be the same B<BIGNUM> as I<a> or