/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/amule/libcryptoxx-5.6.0/ |
H A D | smartptr.h | 12 simple_ptr() : m_p(NULL) {} 13 ~simple_ptr() {delete m_p;} 14 T *m_p; member in class:simple_ptr 20 explicit member_ptr(T *p = NULL) : m_p(p) {} 24 const T& operator*() const { return *m_p; } 25 T& operator*() { return *m_p; } 27 const T* operator->() const { return m_p; } 28 T* operator->() { return m_p; } 30 const T* get() const { return m_p; } 31 T* get() { return m_p; } 46 T *m_p; member in class:member_ptr 123 T *m_p; member in class:counted_ptr [all...] |
H A D | xtrcrypt.cpp | 12 : m_p(p), m_q(q), m_g(g) 18 XTR_FindPrimesAndGenerator(rng, m_p, m_q, m_g, pbits, qbits); 24 m_p.BERDecode(seq); 34 m_p.DEREncode(seq); 44 pass = pass && m_p > Integer::One() && m_p.IsOdd(); 46 GFP2Element three = GFP2_ONB<ModularArithmetic>(m_p).ConvertIn(3); 47 pass = pass && !(m_g.c1.IsNegative() || m_g.c2.IsNegative() || m_g.c1 >= m_p || m_g.c2 >= m_p || m_g == three); 49 pass = pass && ((m_p [all...] |
H A D | rabin.cpp | 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; [all...] |
H A D | xtrcrypt.h | 29 unsigned int AgreedValueLength() const {return 2*m_p.ByteCount();} 31 unsigned int PublicKeyLength() const {return 2*m_p.ByteCount();} 37 const Integer &GetModulus() const {return m_p;} 41 void SetModulus(const Integer &p) {m_p = p;} 48 Integer m_p, m_q; member in class:XTR_DH
|
H A D | esign.cpp | 105 m_p.GenerateRandom(rng, CombinedNameValuePairs(primeParam, MakeParameters("Seed", ConstByteArrayParameter(seed)))); 111 m_p.GenerateRandom(rng, primeParam); 115 m_n = m_p * m_p * m_q; 125 m_p.BERDecode(privateKey); 135 m_p.DEREncode(privateKey); 144 Integer pq = m_p * m_q; 145 Integer p2 = m_p * m_p; 163 ModularArithmetic modp(m_p); [all...] |
H A D | rw.cpp | 97 m_p.GenerateRandom(rng, CombinedNameValuePairs(primeParam, MakeParameters("EquivalentTo", 3)("Mod", 8))); 100 m_n = m_p * m_q; 101 m_u = m_q.InverseMod(m_p); 108 m_p.BERDecode(seq); 118 m_p.DEREncode(seq); 136 Integer cp=re%m_p, cq=re%m_q; 137 if (Jacobi(cp, m_p) * Jacobi(cq, m_q) != 1) 139 cp = cp.IsOdd() ? (cp+m_p) >> 1 : cp >> 1; 147 cp = ModularSquareRoot(cp, m_p); 152 Integer y = CRT(cq, m_q, cp, m_p, m_ [all...] |
H A D | luc.cpp | 123 m_p.GenerateRandom(rng, primeParam); 126 m_n = m_p * m_q; 127 m_u = m_q.InverseMod(m_p); 145 m_p.BERDecode(seq); 159 m_p.DEREncode(seq); 169 return InverseLucas(m_e, x, m_q, m_p, m_u); 175 pass = pass && m_p > Integer::One() && m_p.IsOdd() && m_p < m_n; 177 pass = pass && m_u.IsPositive() && m_u < m_p; [all...] |
H A D | rsa.cpp | 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 [all...] |
H A D | rabin.h | 53 {m_n = n; m_r = r; m_s = s; m_p = p; m_q = q; m_u = u;} 68 const Integer& GetPrime1() const {return m_p;} 72 void SetPrime1(const Integer &p) {m_p = p;} 77 Integer m_p, m_q, m_u; member in class:InvertibleRabinFunction
|
H A D | rw.h | 47 {m_n = n; m_p = p; m_q = q; m_u = u;} 64 const Integer& GetPrime1() const {return m_p;} 68 void SetPrime1(const Integer &p) {m_p = p;} 73 Integer m_p, m_q, m_u; member in class:InvertibleRWFunction
|
H A D | luc.h | 60 {m_n = n; m_e = e; m_p = p; m_q = q; m_u = u;} 74 const Integer& GetPrime1() const {return m_p;} 78 void SetPrime1(const Integer &p) {m_p = p;} 83 Integer m_p, m_q, m_u; member in class:InvertibleLUCFunction 123 void SetModulus(const Integer &v) {m_p = v;} 124 const Integer & GetModulus() const {return m_p;} 127 Integer m_p; member in class:DL_GroupPrecomputation_LUC
|
H A D | esign.h | 58 {m_n = n; m_e = e; m_p = p; m_q = q;} 75 const Integer& GetPrime1() const {return m_p;} 78 void SetPrime1(const Integer &p) {m_p = p;} 82 Integer m_p, m_q; member in class:InvertibleESIGNFunction
|
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;} 88 const Integer& GetPrime1() const {return m_p;} 95 void SetPrime1(const Integer &p) {m_p = p;} 103 Integer m_d, m_p, m_q, m_dp, m_dq, m_u; member in class:InvertibleRSAFunction
|
H A D | misc.h | 134 s_pObject.m_p = m_objectFactory(); 148 return *s_pObject.m_p;
|
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/amule/wxWidgets-2.8.12/tests/archive/ |
H A D | archivetest.cpp | 287 explicit Ptr(T* p = NULL) : m_p(p), m_count(new int) { *m_count = 1; } 288 Ptr(const Ptr& sp) : m_p(sp.m_p), m_count(sp.m_count) { ++*m_count; } 294 m_p = sp.m_p; 301 T* get() const { return m_p; } 302 T* operator->() const { return m_p; } 303 T& operator*() const { return *m_p; } 308 delete m_p; 313 T *m_p; member in class:Ptr [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/openssl-1.0.2h/engines/ |
H A D | e_chil.c | 914 HWCryptoHook_MPI m_a, m_p, m_n, m_r; local 928 BN2MPI(m_p, p); 933 ret = p_hwcrhk_ModExp(hwcrhk_context, m_a, m_p, m_n, &m_r, &rmsg); 1020 HWCryptoHook_MPI m_a, m_p, m_q, m_dmp1, m_dmq1, m_iqmp, m_r; local 1031 BN2MPI(m_p, rsa->p); 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 D | e_chil.c | 917 HWCryptoHook_MPI m_a, m_p, m_n, m_r; local 932 BN2MPI(m_p, p); 937 ret = p_hwcrhk_ModExp(hwcrhk_context, m_a, m_p, m_n, &m_r, &rmsg); 1030 HWCryptoHook_MPI m_a, m_p, m_q, m_dmp1, m_dmq1, m_iqmp, m_r; local 1042 BN2MPI(m_p, rsa->p); 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 D | e_chil.c | 914 HWCryptoHook_MPI m_a, m_p, m_n, m_r; local 928 BN2MPI(m_p, p); 933 ret = p_hwcrhk_ModExp(hwcrhk_context, m_a, m_p, m_n, &m_r, &rmsg); 1020 HWCryptoHook_MPI m_a, m_p, m_q, m_dmp1, m_dmq1, m_iqmp, m_r; local 1031 BN2MPI(m_p, rsa->p); 1039 ret = p_hwcrhk_ModExpCRT(hwcrhk_context, m_a, m_p, m_q,
|
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/amule/wxWidgets-2.8.12/src/common/ |
H A D | intl.cpp | 373 wxPluralFormsNodePtr(wxPluralFormsNode *p = NULL) : m_p(p) {} 375 wxPluralFormsNode& operator*() const { return *m_p; } 376 wxPluralFormsNode* operator->() const { return m_p; } 377 wxPluralFormsNode* get() const { return m_p; } 382 wxPluralFormsNode *m_p; member in class:wxPluralFormsNodePtr 403 delete m_p; 407 wxPluralFormsNode *p = m_p; 408 m_p = NULL; 413 if (p != m_p) 415 delete m_p; [all...] |