Irreducible compositions of polynomials over finite fields of even characteristic
From MaRDI portal
Publication:1928790
DOI10.1007/s00200-012-0175-7zbMath1266.11126MaRDI QIDQ1928790
Saeid Mehrabi, Melsik K. Kyureghyan
Publication date: 4 January 2013
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00200-012-0175-7
11T06: Polynomials over finite fields
Related Items
On the construction of irreducible and primitive polynomials from \(\mathbb{F}_{q^m} [x\) to \(\mathbb{F}_q [x]\)]
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Iterated constructions of irreducible polynomials over finite fields with linearly independent roots
- Algebraic algorithms in GF(q)
- Completely normal elements in iterated quadratic extensions of finite fields
- Recurrent methods for constructing irreducible polynomials over \(\text{GF}(2^s)\)
- Recurrent methods for constructing irreducible polynomials over \(\mathbb F_{q}\) of odd characteristics.
- Explicit N-polynomials of \(2\)-power degree over finite fields. I
- Recurrent methods for constructing irreducible polynomials over \(\mathbb F_q\) of odd characteristics. II
- Normal bases of cyclic fields of primepower degree
- Factorization of Multivariate Polynomials Over Finite Fields
- A knapsack-type public key cryptosystem based on arithmetic in finite fields
- On irreducible polynomials of certain types in finite fields
- Algebraic aspects of cryptography. With an appendix on hyperelliptic curves by Alfred J. Menezes, Yi-Hong Wu, and Robert J. Zuccherato
