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

DOI10.1016/J.FFA.2017.10.003zbMath1374.12001arXiv1511.08918OpenAlexW2766069349MaRDI QIDQ1679708

Lucas Reis, Fabio Enrique Brochero Martínez

Publication date: 21 November 2017

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1511.08918

zbMATH Keywords

cyclotomic polynomialsirreducible factorsirreducible polynomial in a finite field

Mathematics Subject Classification ID

Finite fields (field-theoretic aspects) (12E20) Structure theory for finite fields and commutative rings (number-theoretic aspects) (11T30)

Related Items (6)

Unnamed Item ⋮ Factorization of a class of composed polynomials ⋮ On the number of irreducible factors of degree k dividing a given polynomial over GF(q) ⋮ Equal-degree factorization of binomials and trinomials over finite fields ⋮ Factorization of composed polynomials and applications ⋮ Fixed points of the sum of divisors function on \({{\mathbb{F}}}_2[x\)]

Cites Work

• Unnamed Item
• Unnamed Item
• Explicit factorization of \(x^n-1\in \mathbb {F}_q[x\)]
• On fast multiplication of polynomials over arbitrary algebras
• Factorization of the cyclotomic polynomial \(x^{2^n}+1\) over finite fields
• On the Chor-Rivest knapsack cryptosystem
• Computing Frobenius maps and factoring polynomials
• Explicit factorization of \(x^{2^ k}+1\) over \(F_ p\) with prime \(p\equiv 3\bmod 4\)
• Composed products and factors of cyclotomic polynomials over finite fields
• Explicit factorization of \(X^{2^m}p^n-1\) over a finite field
• Efficient computation of roots in finite fields
• Subquadratic-time factoring of polynomials over finite fields
• Explicit Factorizations of Cyclotomic and Dickson Polynomials over Finite Fields
• Fast construction of irreducible polynomials over finite fields

This page was built for publication: Factoring polynomials of the form \(f(x^n) \in \mathbb{F}_q [x]\)