| /netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/amule/libcryptoxx-5.6.0/ |
| H A D | modexppc.h | 26 const Integer & GetModulus() const {return m_mr->GetModulus();} function in class:ModExpPrecomputation
|
| H A D | elgamal.h | 21 return GetGroupParameters().GetModulus().ByteCount();
26 unsigned int len = GetGroupParameters().GetModulus().ByteCount();
35 unsigned int len = GetGroupParameters().GetModulus().ByteCount();
44 const Integer &p = GetGroupParameters().GetModulus();
57 const Integer &p = GetGroupParameters().GetModulus();
|
| H A D | gfpcrypt.cpp | 64 pass = pass && DSA::IsValidPrimeLength(GetModulus().BitCount());
115 const Integer &p = GetModulus(), &q = GetSubgroupOrder();
131 const Integer &p = GetModulus(), &q = GetSubgroupOrder();
193 Integer g(encoded, GetModulus().ByteCount());
221 GetModulus().DEREncode(parameters);
248 ModularArithmetic ma(GetModulus());
254 return a_times_b_mod_c(a, b, GetModulus());
259 ModularArithmetic ma(GetModulus());
265 return STDMIN(GetSubgroupOrder()-1, Integer::Power2(2*DiscreteLogWorkFactor(GetFieldType()*GetModulus().BitCount())));
|
| H A D | gfpcrypt.h | 29 {Initialize(params.GetModulus(), params.GetSubgroupOrder(), params.GetSubgroupGenerator());}
49 Integer GetGroupOrder() const {return GetFieldType() == 1 ? GetModulus()-Integer::One() : GetModulus()+Integer::One();}
54 {element.Encode(encoded, GetModulus().ByteCount());}
55 unsigned int GetEncodedElementSize(bool reversible) const {return GetModulus().ByteCount();}
64 virtual const Integer & GetModulus() const =0;
103 const Integer & GetModulus() const {return this->m_groupPrecomputation.GetModulus();} function in class:DL_GroupParameters_IntegerBasedImpl
111 {return GetModulus() == rhs.GetModulus()
[all...] |
| H A D | xtrcrypt.h | 37 const Integer &GetModulus() const {return m_p;} function in class:XTR_DH
|
| H A D | xtr.h | 54 const Integer& GetModulus() const {return modp.GetModulus();} function in class:GFP2_ONB
147 return result = Exponentiate(a, modp.GetModulus()-2);
161 Integer::Divide(emodp, edivp, e, modp.GetModulus());
|
| H A D | rabin.h | 33 const Integer& GetModulus() const {return m_n;} function in class:RabinFunction
|
| H A D | rw.h | 33 const Integer& GetModulus() const {return m_n;} function in class:RWFunction
|
| H A D | luc.cpp | 38 return Lucas(exponent, m_g, static_cast<const DL_GroupPrecomputation_LUC &>(group).GetModulus());
44 results[i] = Lucas(exponents[i], base, GetModulus());
|
| H A D | luc.h | 42 const Integer & GetModulus() const {return m_n;} function in class:LUCFunction
124 const Integer & GetModulus() const {return m_p;} function in class:DL_GroupPrecomputation_LUC
|
| H A D | esign.h | 39 const Integer & GetModulus() const {return m_n;} function in class:ESIGNFunction
|
| H A D | ec2n.cpp | 144 pass = pass && m_field->GetModulus().IsIrreducible();
155 && !(((x+m_a)*x*x+m_b-(x+y)*y)%m_field->GetModulus()));
|
| H A D | ecp.h | 77 Integer FieldSize() const {return GetField().GetModulus();}
|
| H A D | modarith.h | 41 const Integer& GetModulus() const {return m_modulus;} function in class:ModularArithmetic
|
| H A D | rsa.h | 42 const Integer & GetModulus() const {return m_n;} function in class:RSAFunction
|
| H A D | fipsalgt.cpp | 431 OutputData(output, "P ", pqg.GetModulus());
485 if (priv.GetGroupParameters().GetModulus().BitCount() != modLen)
494 OutputData(output, "P ", priv.GetGroupParameters().GetModulus());
645 if (priv.GetModulus().BitCount() != modLen)
654 OutputData(output, "n ", priv.GetModulus());
|
| H A D | algebra.h | 230 const Element& GetModulus() const function in class:QuotientRing
|
| H A D | ecp.cpp | 31 m_fieldPtr.reset(new MontgomeryRepresentation(ecp.GetField().GetModulus()));
|
| H A D | validat2.cpp | 468 fail = fail || (pGen != pub.GetKey().GetGroupParameters().GetModulus()) || (qGen != pub.GetKey().GetGroupParameters().GetSubgroupOrder());
|