Recurrent methods for constructing irreducible polynomials over F_q of odd characteristics.
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\).
- Recurrent methods for constructing irreducible polynomials over \(\mathbb F_q\) of odd characteristics
- Recurrent methods for constructing irreducible polynomials over F_q of odd characteristics. II
- A recurrent construction of irreducible polynomials of fixed degree over finite fields
- Recursive constructions of irreducible polynomials over finite fields
- The explicit construction of irreducible polynomials over finite fields
- A knapsack-type public key cryptosystem based on arithmetic in finite fields
- Algebraic algorithms in GF(q)
- Algebraic aspects of cryptography. With an appendix on hyperelliptic curves by Alfred J. Menezes, Yi-Hong Wu, and Robert J. Zuccherato
- Algebraic coding theory
- Factorization of Multivariate Polynomials Over Finite Fields
- scientific article; zbMATH DE number 424718 (Why is no real title available?)
- scientific article; zbMATH DE number 4027619 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 1349933 (Why is no real title available?)
- On irreducible polynomials of certain types in finite fields
- On the construction of irreducible self-reciprocal polynomials over finite fields
- Recurrent methods for constructing irreducible polynomials over \(\text{GF}(2^s)\)
- The explicit construction of irreducible polynomials over finite fields
- Recurrent methods for constructing irreducible polynomials over \(\text{GF}(2^s)\)
- Irreducible compositions of polynomials over finite fields of even characteristic
- A recurrent construction of irreducible polynomials of fixed degree over finite fields
- Sequences of irreducible polynomials without prescribed coefficients over odd prime fields
- Recurrent methods for constructing irreducible polynomials over F_q of odd characteristics. II
- Explicit theorems on generator polynomials
- Recurrent methods for constructing irreducible polynomials over \(\mathbb F_q\) of odd characteristics
- A Recurrent Method for Constructing Irreducible Polynomials over Finite Fields
- scientific article; zbMATH DE number 4212184 (Why is no real title available?)
- Reducible over any finite field but irreducible over Q
- scientific article; zbMATH DE number 3897066 (Why is no real title available?)
- Recursive constructions of irreducible polynomials over finite fields
- scientific article; zbMATH DE number 2157326 (Why is no real title available?)
- Factorization of some composite polynomials over finite fields
- Construction of primitive polynomials over finite fields
- On a conjecture on irreducible polynomials over finite fields with restricted coefficients
- Constructions of irreducible polynomials over finite fields with even characteristic
- Irreducible compositions of polynomials over finite fields
- On the construction of certain odd degree irreducible polynomials over finite fields
- Modular composition via factorization
This page was built for publication: Recurrent methods for constructing irreducible polynomials over \(\mathbb F_{q}\) of odd characteristics.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1867478)