Lines Matching refs:m_p
120 m_p.GenerateRandom(rng, primeParam);
123 m_d = m_e.InverseMod(LCM(m_p-1, m_q-1));
126 m_dp = m_d % (m_p-1);
128 m_n = m_p * m_q;
129 m_u = m_q.InverseMod(m_p);
178 m_p = GCD(a-1, n);
179 m_q = n/m_p;
180 m_dp = m_d % (m_p-1);
182 m_u = m_q.InverseMod(m_p);
200 m_p.BERDecode(privateKey);
215 m_p.DEREncode(privateKey);
236 Integer y = ModularRoot(re, m_dq, m_dp, m_q, m_p, m_u);
246 pass = pass && m_p > Integer::One() && m_p.IsOdd() && m_p < m_n;
249 pass = pass && m_dp > Integer::One() && m_dp.IsOdd() && m_dp < m_p;
251 pass = pass && m_u.IsPositive() && m_u < m_p;
254 pass = pass && m_p * m_q == m_n;
255 pass = pass && m_e*m_d % LCM(m_p-1, m_q-1) == 1;
256 pass = pass && m_dp == m_d%(m_p-1) && m_dq == m_d%(m_q-1);
257 pass = pass && m_u * m_q % m_p == 1;
260 pass = pass && VerifyPrime(rng, m_p, level-2) && VerifyPrime(rng, m_q, level-2);