Factoring polynomials of the form f(xn)∈Fq[x]f(x^n)\in \mathbb{F}_q[x]

preprint2015arXivOpen access

Abstract

Let f(x)∈Fq[x]f(x)\in \mathbb{F}_q[x] be an irreducible polynomial of degree mm and exponent ee, and nn be a positive integer such that νp(q−1)≥νp(e)+νp(n)ν_p(q-1)\ge ν_{p}(e)+ν_p(n) for all pp prime divisor of nn. We show a fast algorithm to determine the irreducible factors of f(xn)f(x^n). We also show the irreducible factors in the case when rad(n){\rm rad}(n) divides q−1q-1 and gcd(m,n)=1{\rm gcd}(m, n)=1. Finally, using this algorithm we split xn−1x^n-1 into irreducible factors, in the case when n=2mptn=2^mp^t and qq is a generator of the group Zp2∗\mathbb{Z}_{p^2}^*.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.