Recursive construction of normal polynomials over finite fields

DOI10.1080/09720529.2021.1897215MaRDI QIDQ5059602zbMATH OpenOpenAlexFDO

Authors Prem L. Sharma, Ashima, A. K. Sharma

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

zbMATH Keywords

finite fieldirreducible polynomialnormal polynomialself -reciprocal polynomial

Mathematics Subject Classification ID

Polynomials in general fields (irreducibility, etc.) (12E05) Special polynomials in general fields (12E10) Finite fields (field-theoretic aspects) (12E20)

Recommendations

• Recursive constructions of \(k\)-normal polynomials using some rational transformations over finite fields
• New recursive construction of normal polynomials over finite fields
• Iterated constructions of irreducible polynomials over finite fields with linearly independent roots
• Iterated constructions of completely normal polynomials
• scientific article; zbMATH DE number 1047543

Cites work

• A Recurrent Method for Constructing Irreducible Polynomials over Finite Fields
• Construction of self-reciprocal normal polynomials over finite fields of even characteristic
• Efficient implementations of Gaussian elimination in finite fields on ASICs for MQ cryptographic systems
• Explicit N-polynomials of 2-power degree over finite fields. I
• scientific article; zbMATH DE number 424718 (Why is no real title available?)
• scientific article; zbMATH DE number 3882549 (Why is no real title available?)
• scientific article; zbMATH DE number 3955054 (Why is no real title available?)
• scientific article; zbMATH DE number 4065122 (Why is no real title available?)
• Iterated constructions of irreducible polynomials over finite fields with linearly independent roots
• Matroidal root structure of skew polynomials over finite fields
• On improvements of ther-adding walk in a finite field of characteristic 2
• On irreducible polynomials of certain types in finite fields
• On the k-normal elements and polynomials over finite fields
• Recurrent methods for constructing irreducible polynomials over \(\text{GF}(2^s)\)
• Recursive constructions of \(k\)-normal polynomials using some rational transformations over finite fields
• Recursive constructions of irreducible polynomials over finite fields
• Recursive constructions of N-polynomials over \(\text{GF}(2^s)\)

Cited in

(7)

• Iterated constructions of completely normal polynomials
• On an iterated construction of irreducible polynomials over finite fields of even characteristic by Kyuregyan
• New recursive construction of normal polynomials over finite fields
• Recursive constructions of \(k\)-normal polynomials using some rational transformations over finite fields
• Construction of irreducible polynomials over finite fields
• Iterated constructions of irreducible polynomials over finite fields with linearly independent roots
• Constructions of irreducible polynomials over finite fields with even characteristic

This page was built for publication: Recursive construction of normal polynomials over finite fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5059602)