MTToolBox::AlgorithmPrimitivity Class Reference

Algorithm which check if given polynomial is primitive. More...

#include <AlgorithmPrimitivity.hpp>

Public Member Functions
	AlgorithmPrimitivity ()
	Constructor for polynomials whose degrees are Mersenne Exponent. More...
	AlgorithmPrimitivity (const char *prime_factors[])
	Constructor for general polynomial with GF(2) coefficients. More...
	~AlgorithmPrimitivity ()
	Destructor. More...
bool	operator() (int max_degree, const NTL::GF2X &poly) const
	Check if given polynomial is a primitive polynomial of given max_degree. More...

Detailed Description

Algorithm which check if given polynomial is primitive.

Constructor & Destructor Documentation

MTToolBox::AlgorithmPrimitivity::AlgorithmPrimitivity ( )

inline

Constructor for polynomials whose degrees are Mersenne Exponent.

MTToolBox::AlgorithmPrimitivity::AlgorithmPrimitivity

(

const char *

prime_factors[]

)

Constructor for general polynomial with GF(2) coefficients.

Parameters

[in]

prime_factors

List of character strings of primes which appear in integer factorization of 2degree-1.

MTToolBox::AlgorithmPrimitivity::~AlgorithmPrimitivity ( )

inline

Destructor.

Member Function Documentation

bool MTToolBox::AlgorithmPrimitivity::operator()	(	int	max_degree,
		const NTL::GF2X &	poly
	)		const

Check if given polynomial is a primitive polynomial of given max_degree.

Parameters

[in]	max_degree	状態空間の大きさから定まる最大次数
[in]	poly	GF(2)係数多項式

Returns

true 最大次数の原始多項式の場合

---

The documentation for this class was generated from the following file:

• AlgorithmPrimitivity.hpp