Construction of self-dual normal bases and their complexity

DOI10.1016/J.FFA.2011.10.002MaRDI QIDQ765817zbMATHOpenAlexFDO

Authors François Arnault, Erik Jarl Pickett, Stéphane Vinatier

Publication date 22 March 2012

Published in Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1007.4899

zbMATH Keywords

complexityself-dual normal basisfinite field extensionsorthogonal circulant group

Mathematics Subject Classification ID

Finite fields (field-theoretic aspects) (12E20) Structure theory for finite fields and commutative rings (number-theoretic aspects) (11T30) Number-theoretic algorithms; complexity (11Y16)

Abstract: Recent work of Pickett has given a construction of self-dual normal bases for extensions of finite fields, whenever they exist. In this article we present these results in an explicit and constructive manner and apply them, through computer search, to identify the lowest complexity of self-dual normal bases for extensions of low degree. Comparisons to similar searches amongst normal bases show that the lowest complexity is often achieved from a self-dual normal basis.

Recommendations

• Normal and Self-Dual Normal Bases from Factorization of $cx^{q + 1} + dx^q - ax - b$
• scientific article; zbMATH DE number 1594281
• On weakly self-dual normal bases over finite fields
• Low complexity normal bases
• Complexities of self-dual normal bases

Cites work

• scientific article; zbMATH DE number 424718 (Why is no real title available?)
• scientific article; zbMATH DE number 204179 (Why is no real title available?)
• A method for constructing a self-dual normal basis in odd characteristic extension fields
• A note on orthogonal circulant matrices over finite fields
• Algorithms for exponentiation in finite fields
• Constructing SCN bases in characteristic 2
• Construction of self-dual integral normal bases in abelian extensions of finite and local fields
• Counting and constructing orthogonal circulants
• Elliptic periods for finite fields
• Gauss periods as constructions of low complexity normal bases
• Low Complexity Normal Elements over Finite Fields of Characteristic Two
• Low complexity normal bases
• Normal and Self-Dual Normal Bases from Factorization of $cx^{q + 1} + dx^q - ax - b$
• Normal bases and their dual-bases over finite fields
• On the Number of Self-Dual Bases of GF(q m ) Over GF(q)
• On the complexity of the dual basis of a type I optimal normal basis
• On the complexity of the normal bases via prime Gauss period over finite fields
• Optimal normal bases
• Optimal normal bases in \(GF(p^ n)\)
• Orthogonal circulant matrices over finite fields, and how to find them
• Self-Complementary Normal Bases in Finite Fields
• Selfdual normal bases on \(\mathrm{GF}(q)\)
• The trace of an optimal normal element and low complexity normal bases

Cited in

(11)

• Trace self-orthogonal relations of normal bases
• scientific article; zbMATH DE number 1594281 (Why is no real title available?)
• A method for constructing a self-dual normal basis in odd characteristic extension fields
• Complexities of self-dual normal bases
• Finding normal bases over finite fields with prescribed trace self-orthogonal relations
• Dickson polynomials, completely normal polynomials and the cyclic module structure of specific extensions of finite fields
• On weakly self-dual normal bases over finite fields
• Nilpotent linearized polynomials over finite fields, revisited
• A method for constructing a pseudo self-dual normal basis
• scientific article; zbMATH DE number 25390 (Why is no real title available?)
• On randomly chosen arrangements of \(q+1\) lines with different slopes in \(\mathbb{F}_q^2\)

This page was built for publication: Construction of self-dual normal bases and their complexity

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