diff options
| author | FdaSilvaYY <fdasilvayy@gmail.com> | 2016-06-28 22:51:01 +0200 |
|---|---|---|
| committer | Rich Salz <rsalz@openssl.org> | 2016-06-29 09:56:39 -0400 |
| commit | 02e112a88579ff2592f34015f73dc85f4ed76ad5 (patch) | |
| tree | e99d5fa28c3dbc7b35eda5bce012dd57f6d86267 /crypto/bn/bn_exp.c | |
| parent | 0517ffc47c79136ba09fb34400e9e26c539615d1 (diff) | |
| download | openssl-02e112a88579ff2592f34015f73dc85f4ed76ad5.tar.gz | |
Whitespace cleanup in crypto
Reviewed-by: Andy Polyakov <appro@openssl.org>
Reviewed-by: Kurt Roeckx <kurt@openssl.org>
Reviewed-by: Rich Salz <rsalz@openssl.org>
(Merged from https://github.com/openssl/openssl/pull/1264)
Diffstat (limited to 'crypto/bn/bn_exp.c')
| -rw-r--r-- | crypto/bn/bn_exp.c | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/crypto/bn/bn_exp.c b/crypto/bn/bn_exp.c index d334cf705b..e2f0d5e316 100644 --- a/crypto/bn/bn_exp.c +++ b/crypto/bn/bn_exp.c @@ -97,7 +97,7 @@ int BN_mod_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, const BIGNUM *m, bn_check_top(m); /*- - * For even modulus m = 2^k*m_odd, it might make sense to compute + * For even modulus m = 2^k*m_odd, it might make sense to compute * a^p mod m_odd and a^p mod 2^k separately (with Montgomery * exponentiation for the odd part), using appropriate exponent * reductions, and combine the results using the CRT. |