Lines Matching refs:PolynomialMod2
18 PolynomialMod2::PolynomialMod2()
22 PolynomialMod2::PolynomialMod2(word value, size_t bitLength)
34 PolynomialMod2::PolynomialMod2(const PolynomialMod2& t)
40 void PolynomialMod2::Randomize(RandomNumberGenerator &rng, size_t nbits)
49 PolynomialMod2 PolynomialMod2::AllOnes(size_t bitLength)
51 PolynomialMod2 result((word)0, bitLength);
58 void PolynomialMod2::SetBit(size_t n, int value)
72 byte PolynomialMod2::GetByte(size_t n) const
80 void PolynomialMod2::SetByte(size_t n, byte value)
87 PolynomialMod2 PolynomialMod2::Monomial(size_t i)
89 PolynomialMod2 r((word)0, i+1);
94 PolynomialMod2 PolynomialMod2::Trinomial(size_t t0, size_t t1, size_t t2)
96 PolynomialMod2 r((word)0, t0+1);
103 PolynomialMod2 PolynomialMod2::Pentanomial(size_t t0, size_t t1, size_t t2, size_t t3, size_t t4)
105 PolynomialMod2 r((word)0, t0+1);
117 PolynomialMod2 * operator()() const
119 return new PolynomialMod2(i);
123 const PolynomialMod2 &PolynomialMod2::Zero()
125 return Singleton<PolynomialMod2>().Ref();
128 const PolynomialMod2 &PolynomialMod2::One()
130 return Singleton<PolynomialMod2, NewPolynomialMod2<1> >().Ref();
133 void PolynomialMod2::Decode(const byte *input, size_t inputLen)
139 void PolynomialMod2::Encode(byte *output, size_t outputLen) const
145 void PolynomialMod2::Decode(BufferedTransformation &bt, size_t inputLen)
157 void PolynomialMod2::Encode(BufferedTransformation &bt, size_t outputLen) const
163 void PolynomialMod2::DEREncodeAsOctetString(BufferedTransformation &bt, size_t length) const
170 void PolynomialMod2::BERDecodeAsOctetString(BufferedTransformation &bt, size_t length)
179 unsigned int PolynomialMod2::WordCount() const
184 unsigned int PolynomialMod2::ByteCount() const
193 unsigned int PolynomialMod2::BitCount() const
202 unsigned int PolynomialMod2::Parity() const
211 PolynomialMod2& PolynomialMod2::operator=(const PolynomialMod2& t)
217 PolynomialMod2& PolynomialMod2::operator^=(const PolynomialMod2& t)
224 PolynomialMod2 PolynomialMod2::Xor(const PolynomialMod2 &b) const
228 PolynomialMod2 result((word)0, b.reg.size()*WORD_BITS);
235 PolynomialMod2 result((word)0, reg.size()*WORD_BITS);
242 PolynomialMod2 PolynomialMod2::And(const PolynomialMod2 &b) const
244 PolynomialMod2 result((word)0, WORD_BITS*STDMIN(reg.size(), b.reg.size()));
249 PolynomialMod2 PolynomialMod2::Times(const PolynomialMod2 &b) const
251 PolynomialMod2 result((word)0, BitCount() + b.BitCount());
262 PolynomialMod2 PolynomialMod2::Squared() const
266 PolynomialMod2 result((word)0, 2*reg.size()*WORD_BITS);
282 void PolynomialMod2::Divide(PolynomialMod2 &remainder, PolynomialMod2 "ient,
283 const PolynomialMod2 ÷nd, const PolynomialMod2 &divisor)
286 throw PolynomialMod2::DivideByZero();
307 PolynomialMod2 PolynomialMod2::DividedBy(const PolynomialMod2 &b) const
309 PolynomialMod2 remainder, quotient;
310 PolynomialMod2::Divide(remainder, quotient, *this, b);
314 PolynomialMod2 PolynomialMod2::Modulo(const PolynomialMod2 &b) const
316 PolynomialMod2 remainder, quotient;
317 PolynomialMod2::Divide(remainder, quotient, *this, b);
321 PolynomialMod2& PolynomialMod2::operator<<=(unsigned int n)
385 PolynomialMod2& PolynomialMod2::operator>>=(unsigned int n)
421 PolynomialMod2 PolynomialMod2::operator<<(unsigned int n) const
423 PolynomialMod2 result(*this);
427 PolynomialMod2 PolynomialMod2::operator>>(unsigned int n) const
429 PolynomialMod2 result(*this);
433 bool PolynomialMod2::operator!() const
440 bool PolynomialMod2::Equals(const PolynomialMod2 &rhs) const
456 std::ostream& operator<<(std::ostream& out, const PolynomialMod2 &a)
505 PolynomialMod2 PolynomialMod2::Gcd(const PolynomialMod2 &a, const PolynomialMod2 &b)
507 return EuclideanDomainOf<PolynomialMod2>().Gcd(a, b);
510 PolynomialMod2 PolynomialMod2::InverseMod(const PolynomialMod2 &modulus) const
512 typedef EuclideanDomainOf<PolynomialMod2> Domain;
516 bool PolynomialMod2::IsIrreducible() const
522 PolynomialMod2 t(2), u(t);
534 GF2NP::GF2NP(const PolynomialMod2 &modulus)
535 : QuotientRing<EuclideanDomainOf<PolynomialMod2> >(EuclideanDomainOf<PolynomialMod2>(), modulus), m(modulus.Degree())
565 z = PolynomialMod2::Zero();
584 : GF2NP(PolynomialMod2::Trinomial(t0, t1, t2))