On the Complexity of the Dual Bases of the Gaussian Normal Bases

DOI10.1142/S1005386715000760zbMath1356.11088OpenAlexW2249767505MaRDI QIDQ3460294

Wagish Shukla, Alok Mishra, Rajendra K. Sharma

Publication date: 7 January 2016

Published in: Algebra Colloquium (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1005386715000760

zbMATH Keywords

finite fieldstrace mapdual basescomplexity of a normal basisGaussian normal basis of type \((n, t)\)

Mathematics Subject Classification ID

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

Cites Work

• The Gaussian normal basis and its trace basis over finite fields
• Gauss periods as constructions of low complexity normal bases
• A method for constructing a self-dual normal basis in odd characteristic extension fields
• Algorithms for exponentiation in finite fields

This page was built for publication: On the Complexity of the Dual Bases of the Gaussian Normal Bases