MTToolBox
0.2.10
|
This file provides functions calculating minimal polynomials and checking primitivity. More...
#include <stdint.h>
#include <NTL/GF2X.h>
#include <NTL/vector.h>
#include <MTToolBox/AbstractGenerator.hpp>
#include <MTToolBox/util.hpp>
Go to the source code of this file.
Namespaces | |
MTToolBox | |
name space for MTToolBox | |
Functions | |
template<typename U > | |
void | MTToolBox::minpoly (NTL::GF2X &poly, AbstractGenerator< U > &generator, int pos=0, int stateSize=0) |
Calculate minimal polynomial of output sequence. More... | |
bool | MTToolBox::isMexp (uint32_t degree) |
Returns if 2degree-1 is prime number. More... | |
bool | MTToolBox::isIrreducible (const NTL::GF2X &poly) |
Check if polynomial is irreducible. More... | |
bool | MTToolBox::isPrime (const NTL::GF2X &poly) |
Check if polynomial is primitive. More... | |
bool | MTToolBox::isPrime (const NTL::GF2X &poly, int degree, const NTL::Vec< NTL::ZZ > &prime_factors) |
Check if polynomial is primitive. More... | |
bool | MTToolBox::isPrime (const NTL::GF2X &poly, int degree, const char *prime_factors[]) |
Check if polynomial is primitive. More... | |
bool | MTToolBox::hasFactorOfDegree (NTL::GF2X &poly, long degree) |
Check if primitive polynomial of given degree appears in factorization of poly. More... | |
This file provides functions calculating minimal polynomials and checking primitivity.
Copyright (C) 2013 Mutsuo Saito, Makoto Matsumoto and Hiroshima University. All rights reserved.
The 3-clause BSD License is applied to this software, see LICENSE.txt