32 for (
i = deg-1;
i >= 0;
i-- )
52 BuildIrred (NTLirredpoly,
i);
CanonicalForm convertNTLzzpX2CF(const zz_pX &poly, const Variable &x)
Conversion to and from NTL.
declarations of higher level algorithms.
CFFList factorize(const CanonicalForm &f, bool issqrfree=false)
factorization over or
CanonicalForm randomIrredpoly(int i, const Variable &x)
computes a random monic irreducible univariate polynomial in x over Fp of degree i via NTL
CanonicalForm find_irreducible(int deg, CFRandom &gen, const Variable &x)
generate a random irreducible polynomial in x of degree deg
static bool is_irreducible(const CanonicalForm &f)
generate random integers, random elements of finite fields
virtual class for random element generation
virtual CanonicalForm generate() const
factory's class for variables