Searched refs:m_dq (Results 1 - 2 of 2) sorted by relevance
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/amule/libcryptoxx-5.6.0/ |
H A D | rsa.cpp | 127 m_dq = m_d % (m_q-1); 181 m_dq = m_d % (m_q-1); 203 m_dq.BERDecode(privateKey); 218 m_dq.DEREncode(privateKey); 236 Integer y = ModularRoot(re, m_dq, m_dp, m_q, m_p, m_u); 250 pass = pass && m_dq > Integer::One() && m_dq.IsOdd() && m_dq < m_q; 256 pass = pass && m_dp == m_d%(m_p-1) && m_dq == m_d%(m_q-1);
|
H A D | rsa.h | 60 {m_n = n; m_e = e; m_d = d; m_p = p; m_q = q; m_dp = dp; m_dq = dq; m_u = u;} 92 const Integer& GetModPrime2PrivateExponent() const {return m_dq;} 99 void SetModPrime2PrivateExponent(const Integer &dq) {m_dq = dq;} 103 Integer m_d, m_p, m_q, m_dp, m_dq, m_u; member in class:InvertibleRSAFunction
|
Completed in 34 milliseconds