Searched refs:m_q (Results 1 - 19 of 19) sorted by relevance

/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/amule/libcryptoxx-5.6.0/
H A Drabin.cpp90 m_q.GenerateRandom(rng, primeParam);
95 int jq = Jacobi(t, m_q);
112 m_n = m_p * m_q;
113 m_u = m_q.InverseMod(m_p);
123 m_q.BERDecode(seq);
135 m_q.DEREncode(seq);
150 Integer cp=c%m_p, cq=c%m_q;
153 int jq = Jacobi(cq, m_q);
158 cq = cq*EuclideanMultiplicativeInverse(m_r, m_q)%m_q;
[all...]
H A Dxtrcrypt.cpp12 : m_p(p), m_q(q), m_g(g)
18 XTR_FindPrimesAndGenerator(rng, m_p, m_q, m_g, pbits, qbits);
25 m_q.BERDecode(seq);
35 m_q.DEREncode(seq);
45 pass = pass && m_q > Integer::One() && m_q.IsOdd();
49 pass = pass && ((m_p.Squared()-m_p+1)%m_q).IsZero();
52 pass = pass && VerifyPrime(rng, m_p, level-2) && VerifyPrime(rng, m_q, level-2);
53 pass = pass && XTR_Exponentiate(m_g, (m_p.Squared()-m_p+1)/m_q, m_p) != three;
54 pass = pass && XTR_Exponentiate(m_g, m_q, m_
[all...]
H A Drw.cpp98 m_q.GenerateRandom(rng, CombinedNameValuePairs(primeParam, MakeParameters("EquivalentTo", 7)("Mod", 8)));
100 m_n = m_p * m_q;
101 m_u = m_q.InverseMod(m_p);
109 m_q.BERDecode(seq);
119 m_q.DEREncode(seq);
136 Integer cp=re%m_p, cq=re%m_q;
137 if (Jacobi(cp, m_p) * Jacobi(cq, m_q) != 1)
140 cq = cq.IsOdd() ? (cq+m_q) >> 1 : cq >> 1;
149 cq = ModularSquareRoot(cq, m_q);
152 Integer y = CRT(cq, m_q, c
[all...]
H A Dxtrcrypt.h30 unsigned int PrivateKeyLength() const {return m_q.ByteCount();}
38 const Integer &GetSubgroupOrder() const {return m_q;}
42 void SetSubgroupOrder(const Integer &q) {m_q = q;}
48 Integer m_p, m_q; member in class:XTR_DH
H A Dluc.cpp124 m_q.GenerateRandom(rng, primeParam);
126 m_n = m_p * m_q;
127 m_u = m_q.InverseMod(m_p);
146 m_q.BERDecode(seq);
160 m_q.DEREncode(seq);
169 return InverseLucas(m_e, x, m_q, m_p, m_u);
176 pass = pass && m_q > Integer::One() && m_q.IsOdd() && m_q < m_n;
180 pass = pass && m_p * m_q
[all...]
H A Design.cpp107 m_q.GenerateRandom(rng, CombinedNameValuePairs(primeParam, MakeParameters("Seed", ConstByteArrayParameter(seed))));
112 m_q.GenerateRandom(rng, primeParam);
115 m_n = m_p * m_p * m_q;
126 m_q.BERDecode(privateKey);
136 m_q.DEREncode(privateKey);
144 Integer pq = m_p * m_q;
185 pass = pass && m_q > Integer::One() && m_q.IsOdd() && m_q < m_n;
186 pass = pass && m_p.BitCount() == m_q
[all...]
H A Drsa.cpp121 m_q.GenerateRandom(rng, primeParam);
123 m_d = m_e.InverseMod(LCM(m_p-1, m_q-1));
127 m_dq = m_d % (m_q-1);
128 m_n = m_p * m_q;
129 m_u = m_q.InverseMod(m_p);
179 m_q = n/m_p;
181 m_dq = m_d % (m_q-1);
182 m_u = m_q.InverseMod(m_p);
201 m_q.BERDecode(privateKey);
216 m_q
[all...]
H A Drabin.h53 {m_n = n; m_r = r; m_s = s; m_p = p; m_q = q; m_u = u;}
69 const Integer& GetPrime2() const {return m_q;}
73 void SetPrime2(const Integer &q) {m_q = q;}
77 Integer m_p, m_q, m_u; member in class:InvertibleRabinFunction
H A Drw.h47 {m_n = n; m_p = p; m_q = q; m_u = u;}
65 const Integer& GetPrime2() const {return m_q;}
69 void SetPrime2(const Integer &q) {m_q = q;}
73 Integer m_p, m_q, m_u; member in class:InvertibleRWFunction
H A Design.h58 {m_n = n; m_e = e; m_p = p; m_q = q;}
76 const Integer& GetPrime2() const {return m_q;}
79 void SetPrime2(const Integer &q) {m_q = q;}
82 Integer m_p, m_q; member in class:InvertibleESIGNFunction
H A Dmqueue.cpp97 MessageQueue &q1 = m_q[i], &q2 = m_q[1-i];
148 MessageQueue &q1 = m_q[i], &q2 = m_q[1-i];
H A Dluc.h60 {m_n = n; m_e = e; m_p = p; m_q = q; m_u = u;}
75 const Integer& GetPrime2() const {return m_q;}
79 void SetPrime2(const Integer &q) {m_q = q;}
83 Integer m_p, m_q, m_u; member in class:InvertibleLUCFunction
H A Drsa.h60 {m_n = n; m_e = e; m_d = d; m_p = p; m_q = q; m_dp = dp; m_dq = dq; m_u = u;}
89 const Integer& GetPrime2() const {return m_q;}
96 void SetPrime2(const Integer &q) {m_q = q;}
103 Integer m_d, m_p, m_q, m_dp, m_dq, m_u; member in class:InvertibleRSAFunction
H A Dmqueue.h86 MessageQueue m_q[2]; member in class:EqualityComparisonFilter
H A Dgfpcrypt.h48 const Integer & GetSubgroupOrder() const {return m_q;}
68 {m_q = q; ParametersChanged();}
79 Integer m_q; member in class:DL_GroupParameters_IntegerBased
203 // check r == (m_g^s * m_y^r + m) mod m_q
H A Dgfpcrypt.cpp222 m_q.DEREncode(parameters);
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/openssl-1.0.2h/engines/
H A De_chil.c1020 HWCryptoHook_MPI m_a, m_p, m_q, m_dmp1, m_dmq1, m_iqmp, m_r; local
1032 BN2MPI(m_q, rsa->q);
1039 ret = p_hwcrhk_ModExpCRT(hwcrhk_context, m_a, m_p, m_q,
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/timemachine/openssl-0.9.8e/engines/
H A De_chil.c1030 HWCryptoHook_MPI m_a, m_p, m_q, m_dmp1, m_dmq1, m_iqmp, m_r; local
1043 BN2MPI(m_q, rsa->q);
1050 ret = p_hwcrhk_ModExpCRT(hwcrhk_context, m_a, m_p, m_q,
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/openssl/engines/
H A De_chil.c1020 HWCryptoHook_MPI m_a, m_p, m_q, m_dmp1, m_dmq1, m_iqmp, m_r; local
1032 BN2MPI(m_q, rsa->q);
1039 ret = p_hwcrhk_ModExpCRT(hwcrhk_context, m_a, m_p, m_q,

Completed in 127 milliseconds