summaryrefslogtreecommitdiff
path: root/rsa.cpp
diff options
context:
space:
mode:
authorJeffrey Walton <noloader@gmail.com>2017-01-29 04:58:56 -0500
committerJeffrey Walton <noloader@gmail.com>2017-01-29 04:58:56 -0500
commitb8adc91ce888b94505f383101ed3a2b06e4a70a2 (patch)
treeb544c3450f2216194ba7b5722c3fd07c7c44cbce /rsa.cpp
parent7c7e8aa8046ac6689f4a5468842e4333badebc6c (diff)
downloadcryptopp-git-b8adc91ce888b94505f383101ed3a2b06e4a70a2.tar.gz
Add asserts to validation routines
Diffstat (limited to 'rsa.cpp')
-rw-r--r--rsa.cpp16
1 files changed, 16 insertions, 0 deletions
diff --git a/rsa.cpp b/rsa.cpp
index 73d796e9..c730ac39 100644
--- a/rsa.cpp
+++ b/rsa.cpp
@@ -73,7 +73,9 @@ bool RSAFunction::Validate(RandomNumberGenerator& rng, unsigned int level) const
bool pass = true;
pass = pass && m_n > Integer::One() && m_n.IsOdd();
+ CRYPTOPP_ASSERT(pass);
pass = pass && m_e > Integer::One() && m_e.IsOdd() && m_e < m_n;
+ CRYPTOPP_ASSERT(pass);
return pass;
}
@@ -247,21 +249,35 @@ Integer InvertibleRSAFunction::CalculateInverse(RandomNumberGenerator &rng, cons
bool InvertibleRSAFunction::Validate(RandomNumberGenerator &rng, unsigned int level) const
{
bool pass = RSAFunction::Validate(rng, level);
+ CRYPTOPP_ASSERT(pass);
pass = pass && m_p > Integer::One() && m_p.IsOdd() && m_p < m_n;
+ CRYPTOPP_ASSERT(pass);
pass = pass && m_q > Integer::One() && m_q.IsOdd() && m_q < m_n;
+ CRYPTOPP_ASSERT(pass);
pass = pass && m_d > Integer::One() && m_d.IsOdd() && m_d < m_n;
+ CRYPTOPP_ASSERT(pass);
pass = pass && m_dp > Integer::One() && m_dp.IsOdd() && m_dp < m_p;
+ CRYPTOPP_ASSERT(pass);
pass = pass && m_dq > Integer::One() && m_dq.IsOdd() && m_dq < m_q;
+ CRYPTOPP_ASSERT(pass);
pass = pass && m_u.IsPositive() && m_u < m_p;
+ CRYPTOPP_ASSERT(pass);
if (level >= 1)
{
pass = pass && m_p * m_q == m_n;
+ CRYPTOPP_ASSERT(pass);
pass = pass && m_e*m_d % LCM(m_p-1, m_q-1) == 1;
+ CRYPTOPP_ASSERT(pass);
pass = pass && m_dp == m_d%(m_p-1) && m_dq == m_d%(m_q-1);
+ CRYPTOPP_ASSERT(pass);
pass = pass && m_u * m_q % m_p == 1;
+ CRYPTOPP_ASSERT(pass);
}
if (level >= 2)
+ {
pass = pass && VerifyPrime(rng, m_p, level-2) && VerifyPrime(rng, m_q, level-2);
+ CRYPTOPP_ASSERT(pass);
+ }
return pass;
}