| /netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/amule/libcryptoxx-5.6.0/ |
| H A D | ec2n.cpp | 200 m_field->Accumulate(x, t);
201 m_field->Accumulate(x, Q.x);
202 m_field->Accumulate(x, m_a);
204 m_field->Accumulate(x, P.x);
205 m_field->Accumulate(m_R.y, x);
218 m_field->Accumulate(t, P.x);
221 m_field->Accumulate(m_R.x, t);
222 m_field->Accumulate(m_R.x, m_a);
223 m_field->Accumulate(m_R.y, m_field->Multiply(t, m_R.x));
224 m_field->Accumulate(m_
[all...] |
| H A D | algebra.cpp | 27 template <class T> T& AbstractGroup<T>::Accumulate(Element &a, const Element &b) const function in class:AbstractGroup
162 Accumulate(result, powerTable[(power2<<w) + power1]);
194 group.Accumulate(begin->base, last->base); // avoid overhead of ScalarMultiply()
196 group.Accumulate(begin->base, group.ScalarMultiply(last->base, q));
283 Accumulate(bucket, Inverse(g));
285 Accumulate(bucket, g);
306 Accumulate(buckets[i][j], buckets[i][j+1]);
307 Accumulate(r, buckets[i][j]);
309 Accumulate(buckets[i][0], buckets[i][1]);
|
| H A D | gf256.h | 29 Element& Accumulate(Element &a, Element b) const function in class:GF256
|
| H A D | gf2_32.h | 29 Element& Accumulate(Element &a, Element b) const function in class:GF2_32
|
| H A D | xtr.h | 106 Element& Accumulate(Element &a, const Element &b) const function in class:GFP2_ONB
108 modp.Accumulate(a.c1, b.c1);
109 modp.Accumulate(a.c2, b.c2);
196 modp.Accumulate(result.c1, modp.Multiply(z.c2, modp.Subtract(t, x.c1)));
199 modp.Accumulate(result.c2, modp.Multiply(z.c1, modp.Subtract(t, x.c2)));
|
| H A D | xtr.cpp | 75 gfp2.Accumulate(S[0], gfp2.SpecialOperation2(S[2], c, S[1]));
83 gfp2.Accumulate(S[2], gfp2.SpecialOperation2(S[0], cp, S[1]));
|
| H A D | algebra.h | 34 virtual Element& Accumulate(Element &a, const Element &b) const;
85 Element& Accumulate(Element &a, const Element &b) const function in class:AbstractRing::MultiplicativeGroupT
171 Element& Accumulate(Element &a, const Element &b) const function in class:EuclideanDomainOf
242 Element& Accumulate(Element &a, const Element &b) const function in class:QuotientRing
243 {return m_domain.Accumulate(a, b);}
|
| H A D | polynomi.cpp | 104 PolynomialOver<T>& PolynomialOver<T>::Accumulate(const PolynomialOver<T>& t, const Ring &ring) function in class:PolynomialOver
112 ring.Accumulate(m_coefficients[i], t.GetCoefficient(i, ring));
143 ring.Accumulate(result, m_coefficients[j]);
303 ring.Accumulate(result.m_coefficients[i+j], ring.Multiply(m_coefficients[i], t.m_coefficients[j]));
509 m_ring.Accumulate(result, alpha[j]);
559 ring.Accumulate(result, ring.Multiply(y[i], v[i]));
|
| H A D | polynomi.h | 128 PolynomialOver<Ring>& Accumulate(const PolynomialOver<Ring>& t, const Ring &ring);
223 ThisType& operator+=(const ThisType& t) {Accumulate(t, ms_fixedRing); return *this;}
332 Element& Accumulate(Element &a, const Element &b) const function in class:RingOfPolynomialsOver
333 {a.Accumulate(b, m_ring); return a;}
|
| H A D | modarith.h | 62 Integer& Accumulate(Integer &a, const Integer &b) const;
|
| H A D | gf2n.cpp | 571 Accumulate(z, Multiply(w, a));
572 Accumulate(w, p);
|
| H A D | integer.cpp | 4080 Integer& ModularArithmetic::Accumulate(Integer &a, const Integer &b) const
|