Construction of self-dual normal bases and their complexity

DOI10.1016/J.FFA.2011.10.002zbMATH Open1261.11086arXiv1007.4899OpenAlexW3104274122MaRDI QIDQ765817FDOQ765817

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)

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.

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

Recommendations

• Normal and Self-Dual Normal Bases from Factorization of $cx^{q + 1} + dx^q - ax - b$
• Publication:2712098
• On weakly self-dual normal bases over finite fields
• Low complexity normal bases
• Complexities of self-dual normal bases

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)

Cites Work

• On the Number of Self-Dual Bases of GF(q m ) Over GF(q)
• A note on orthogonal circulant matrices over finite fields
• Orthogonal circulant matrices over finite fields, and how to find them
• Title not available (Why is that?)
• Optimal normal bases in \(GF(p^ n)\)
• Low complexity normal bases
• Algorithms for exponentiation in finite fields
• Construction of self-dual integral normal bases in abelian extensions of finite and local fields
• Self-Complementary Normal Bases in Finite Fields
• Constructing SCN bases in characteristic 2
• A method for constructing a self-dual normal basis in odd characteristic extension fields
• The trace of an optimal normal element and low complexity normal bases
• Optimal normal bases
• Normal bases and their dual-bases over finite fields
• Gauss periods as constructions of low complexity normal bases
• 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
• Normal and Self-Dual Normal Bases from Factorization of $cx^{q + 1} + dx^q - ax - b$
• Elliptic periods for finite fields
• Title not available (Why is that?)
• Low Complexity Normal Elements over Finite Fields of Characteristic Two
• Selfdual normal bases on \(\mathrm{GF}(q)\)
• Counting and constructing orthogonal circulants

Cited In (11)

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

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)