An algorithm for determining the irreducible polynomials over finite fields

2015/05/02 by Samuel H. Dalalyan, Dalalyan, Samuel H.
Computer Science · #Coding theory and cryptography #Cryptography and Residue Arithmetic #Polynomial and algebraic computation

paper · pdf · doi:10.48550/arxiv.1505.00776

Abstract

We propose an algorithm for determining the irreducible polynomials over finite fields, based on the use of the companion matrix of polynomials and the generalized Jordan normal form of square matrices.

Related

• Irreducible Compositions of Polynomials over Finite Fields
• Degrees of irreducible polynomials over binary field
• Number of irreducible polynomials in several variables over finite fields
• Counting irreducible polynomials with prescribed coefficients over a finite field
• Enumerating all the Irreducible Polynomials over Finite Field