Generation of irreducible polynomials related by power dependence of the roots

Abstract: A method, which is intended for obtaining new irreducible polynomials from the given irreducible polynomial of the same degree provided the roots of these polynomials are related by power dependence, is considered. The method is used in cryptography and coding theory. The expressions for generation of such polynomials are given.

Keywords: irreducible polynomial, coding, modulo comparability, polynomial degree, polynomials generation algorithm, coefficient

For citation:
Titov S. S., Torgashova A. V. Generation of irreducible polynomials related by power dependence of the roots. Doklady Tomskogo gosudarstvennogo universiteta sistem upravleniya i radioelektroniki, 2010, no. 2(22), – p. 1. pp. 310–318.