Searched refs:Gcd (Results 1 - 9 of 9) sorted by relevance
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/amule/libcryptoxx-5.6.0/ |
H A D | nbtheory.h | 64 {return Integer::Gcd(a,b);} 66 {return Integer::Gcd(a,b) == Integer::One();} 68 {return a/Integer::Gcd(a,b)*b;}
|
H A D | algebra.h | 146 virtual const Element& Gcd(const Element &a, const Element &b) const; 258 {return m_domain.IsUnit(m_domain.Gcd(a, m_modulus));}
|
H A D | modarith.h | 83 {return Integer::Gcd(a, m_modulus).IsUnit();}
|
H A D | gf2n.cpp | 505 PolynomialMod2 PolynomialMod2::Gcd(const PolynomialMod2 &a, const PolynomialMod2 &b) function in class:PolynomialMod2 507 return EuclideanDomainOf<PolynomialMod2>().Gcd(a, b); 526 if (!Gcd(u+t, *this).IsUnit())
|
H A D | algebra.cpp | 56 template <class T> const T& AbstractEuclideanDomain<T>::Gcd(const Element &a, const Element &b) const function in class:AbstractEuclideanDomain
|
H A D | gf2n.h | 219 static PolynomialMod2 CRYPTOPP_API Gcd(const PolynomialMod2 &a, const PolynomialMod2 &n);
|
H A D | integer.h | 350 static Integer CRYPTOPP_API Gcd(const Integer &a, const Integer &n);
|
H A D | pubkey.h | 765 pass = pass && Integer::Gcd(x, q) == Integer::One();
|
H A D | integer.cpp | 3963 Integer Integer::Gcd(const Integer &a, const Integer &b) 3965 return EuclideanDomainOf<Integer>().Gcd(a, b);
|
Completed in 133 milliseconds