diff options
author | weidai <weidai@57ff6487-cd31-0410-9ec3-f628ee90f5f0> | 2003-03-25 02:11:53 +0000 |
---|---|---|
committer | weidai <weidai@57ff6487-cd31-0410-9ec3-f628ee90f5f0> | 2003-03-25 02:11:53 +0000 |
commit | 79694912becd37f5f0077464350f3db55dd2ca7c (patch) | |
tree | c0941e611df79f42cd10632c1cd2fd4dc2895078 /rsa.cpp | |
parent | d1302bdf601282b27a681b121b2663841db92353 (diff) | |
download | cryptopp-79694912becd37f5f0077464350f3db55dd2ca7c.tar.gz |
minor changes
git-svn-id: svn://svn.code.sf.net/p/cryptopp/code/trunk/c5@53 57ff6487-cd31-0410-9ec3-f628ee90f5f0
Diffstat (limited to 'rsa.cpp')
-rw-r--r-- | rsa.cpp | 8 |
1 files changed, 6 insertions, 2 deletions
@@ -217,13 +217,17 @@ Integer InvertibleRSAFunction::CalculateInverse(RandomNumberGenerator &rng, cons { DoQuickSanityCheck(); ModularArithmetic modn(m_n); - Integer r(rng, Integer::One(), m_n - Integer::One()); + Integer r, rInv; + do { // do this loop for people using small numbers for testing + r.Randomize(rng, Integer::One(), m_n - Integer::One()); + rInv = modn.MultiplicativeInverse(r); + } while (rInv.IsZero()); Integer re = modn.Exponentiate(r, m_e); re = modn.Multiply(re, x); // blind // here we follow the notation of PKCS #1 and let u=q inverse mod p // but in ModRoot, u=p inverse mod q, so we reverse the order of p and q Integer y = ModularRoot(re, m_dq, m_dp, m_q, m_p, m_u); - y = modn.Divide(y, r); // unblind + y = modn.Multiply(y, rInv); // unblind if (modn.Exponentiate(y, m_e) != x) // check throw Exception(Exception::OTHER_ERROR, "InvertibleRSAFunction: computational error during private key operation"); return y; |