Recurrent methods for constructing irreducible polynomials over \(\mathbb F_{q}\) of odd characteristics.
type: Item
instance of: scholarly article
title: Recurrent methods for constructing irreducible polynomials over \(\mathbb F_{q}\) of odd characteristics.
zbMATH Open document ID: 1090.11072
DOI: 10.1016/S1071-5797(02)00005-9
published in: Finite Fields and their Applications
publication date: 2003-04-02T00:00:00Z
review text: The author presents methods for constructing irreducible polynomials over finite fields \({\mathbb F}_q\). Among others he proves : Let \(q\) be odd, \(P(x)\neq x\) be an irreducible polynomial of degree \(n\geq 1\) over \({\mathbb F}_q\), and \(ax^2+bx+c\) and \(dx^2+rx+h\) be relatively prime polynomials from \({\mathbb F}_q[x]\), with \(a\) or \(d\) being non-zero and \(r^2\neq 4dh\). Let \(H(a,d):=a^n\) if \(d=0\) and \(H(a,d):=d^nP\left(\frac{a}{d}\right)\) if \(d\neq 0\). Suppose \[ (ah)^2+(cd)^2+acr^2+b^2dh-bcdr-abhr- 2acdh=\delta^2 \] for some \(\delta\neq 0\) from \({\mathbb F}_q\). Then the polynomial \[ F(x)=(H(a,d))^{-1}(dx^2+rx+h)^n P\left(\frac{ax^2+bx+c}{dx^2+rx+h}\right) \] is irreducible over \({\mathbb F}_q\) if and only if the element \[ (r^2-4dh)^nP\left(\frac{br-2(cd+ah-\delta)} {r^2-4hd}\right)P\left(\frac{br-2(cd+ah+\delta)} {r^2-4hd}\right) \] is a non-square in \({\mathbb F}_q\).
reviewed by: Florin Nicolae
Mathematics Subject Classification ID: 11T06
zbMATH DE Number: 1891473
zbMATH Keywords: Galois fields
zbMATH Keywords: Irreducible polynomials
zbMATH Keywords: Recurrent method
author: Melsik K. Kuyregyan
MaRDI profile type: Publication
cites work: Algebraic coding theory
cites work: Q4265362
cites work: Algebraic algorithms in GF(q)
cites work: A knapsack-type public key cryptosystem based on arithmetic in finite fields
cites work: On irreducible polynomials of certain types in finite fields
cites work: The explicit construction of irreducible polynomials over finite fields
cites work: Factorization of Multivariate Polynomials Over Finite Fields
cites work: Algebraic aspects of cryptography. With an appendix on hyperelliptic curves by Alfred J. Menezes, Yi-Hong Wu, and Robert J. Zuccherato
cites work: Q3769010
cites work: Recurrent methods for constructing irreducible polynomials over \(\text{GF}(2^s)\)
cites work: Q4146667
cites work: Q3136478
cites work: On the construction of irreducible self-reciprocal polynomials over finite fields
description: scientific article; zbMATH DE number 1891473