Recursive construction of normal polynomials over finite fields
From MaRDI portal
Publication:5059602
DOI10.1080/09720529.2021.1897215OpenAlexW4213186808MaRDI QIDQ5059602
Arun Sharma, Prem L. Sharma, Ashima
Publication date: 23 December 2022
Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/09720529.2021.1897215
Polynomials in general fields (irreducibility, etc.) (12E05) Finite fields (field-theoretic aspects) (12E20) Special polynomials in general fields (12E10)
Related Items (2)
Constructions of irreducible polynomials over finite fields with even characteristic ⋮ Construction of irreducible polynomials over finite fields
Cites Work
- Recursive constructions of irreducible polynomials over finite fields
- Iterated constructions of irreducible polynomials over finite fields with linearly independent roots
- Recursive constructions of N-polynomials over \(\text{GF}(2^s)\)
- Recurrent methods for constructing irreducible polynomials over \(\text{GF}(2^s)\)
- Explicit N-polynomials of \(2\)-power degree over finite fields. I
- A Recurrent Method for Constructing Irreducible Polynomials over Finite Fields
- Matroidal root structure of skew polynomials over finite fields
- Efficient implementations of Gaussian elimination in finite fields on ASICs for MQ cryptographic systems
- On improvements of ther-adding walk in a finite field of characteristic 2
- Recursive constructions of k-normal polynomials using some rational transformations over finite fields
- Construction of self-reciprocal normal polynomials over finite fields of even characteristic
- On irreducible polynomials of certain types in finite fields
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Recursive construction of normal polynomials over finite fields
