This work explores polynomial composition techniques to generate irreducible polynomials in finite fields, indicating their significance in cryptography and coding theory.
Key Points
New methods are introduced to construct irreducible polynomials of degree 6n over finite fields.
The study emphasizes the role of irreducible polynomials in coding theory and cryptography.
The approach includes generating polynomials of degree p2n through polynomial composition under specific constraints.
These findings may enhance techniques used in fields reliant on finite field applications.