Construction of irreducible polynomials through rational transformations

Abstract: Let

m a t h b b F_{q}

be the finite field with

q

elements, where

q

is a power of a prime. We discuss recursive methods for constructing irreducible polynomials over

m a t h b b F_{q}

of high degree using rational transformations. In particular, given a divisor

D > 2

of

q + 1

and an irreducible polynomial

f i n m a t h b b F_{q} [x]

of degree

n

such that

n

is even or

D o t e q u i v 2 p m o d 4

, we show how to obtain from

f

a sequence

{f_{i}}_{i g e 0}

of irreducible polynomials over

m a t h b b F_{q}

with

m a t h r m d e g (f_{i}) = n c d o t D^{i}

.

Recommendations

Cites Work

Cited In (10)

This page was built for publication: Construction of irreducible polynomials through rational transformations