Low Complexity Normal Elements over Finite Fields of Characteristic Two

DOI10.1109/TC.2007.70845MaRDI QIDQ3525131zbMATH OpenOpenAlexFDO

Authors Lucia Moura, Daniel Panario, Ariane M. Masuda, David Thomson

Publication date 10 September 2008

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tc.2007.70845

zbMATH Keywords

computations in finite fieldscomputations on polynomials

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Structure theory for finite fields and commutative rings (number-theoretic aspects) (11T30) Number-theoretic algorithms; complexity (11Y16)

Recommendations

• Low complexity normal bases in \(\mathbb F_{2^n}\)
• Minimum complexity and low-weight normal polynomials over finite fields
• scientific article; zbMATH DE number 1273656
• On Orders of Optimal Normal Basis Generators
• Low complexity normal bases

Cited in

(8)

• Artin-Schreier extensions of normal bases
• Subquadratic-time algorithms for normal bases
• Some algorithms for normality testing irreducible polynomials and computing complexity of the normal polynomials over finite fields
• Minimum complexity and low-weight normal polynomials over finite fields
• Gauss periods as constructions of low complexity normal bases
• An approach to normal polynomials through symmetrization and symmetric reduction
• The complexity of elliptic normal bases
• Construction of self-dual normal bases and their complexity

This page was built for publication: Low Complexity Normal Elements over Finite Fields of Characteristic Two

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