Lines Matching refs:m_p
89 m_p.GenerateRandom(rng, primeParam);
94 int jp = Jacobi(t, m_p);
112 m_n = m_p * m_q;
113 m_u = m_q.InverseMod(m_p);
122 m_p.BERDecode(seq);
134 m_p.DEREncode(seq);
150 Integer cp=c%m_p, cq=c%m_q;
152 int jp = Jacobi(cp, m_p);
157 cp = cp*EuclideanMultiplicativeInverse(m_r, m_p)%m_p;
163 cp = cp*EuclideanMultiplicativeInverse(m_s, m_p)%m_p;
167 cp = ModularSquareRoot(cp, m_p);
171 cp = m_p-cp;
173 Integer out = CRT(cq, m_q, cp, m_p, m_u);
186 pass = pass && m_p > Integer::One() && m_p%4 == 3 && m_p < m_n;
188 pass = pass && m_u.IsPositive() && m_u < m_p;
191 pass = pass && m_p * m_q == m_n;
192 pass = pass && m_u * m_q % m_p == 1;
193 pass = pass && Jacobi(m_r, m_p) == 1;
195 pass = pass && Jacobi(m_s, m_p) == -1;
199 pass = pass && VerifyPrime(rng, m_p, level-2) && VerifyPrime(rng, m_q, level-2);