Complexities of normal bases constructed from Gauss periods

DOI10.1007/S10623-017-0368-YMaRDI QIDQ1741928zbMATH OpenOpenAlexFDO

Authors Xiang-Dong Hou

Publication date 10 April 2018

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10623-017-0368-y

zbMATH Keywords

cyclotomic numberfinite fieldGauss periodnormal basis

Mathematics Subject Classification ID

Cyclotomy (11T22) Structure theory for finite fields and commutative rings (number-theoretic aspects) (11T30) Solving polynomial systems; resultants (13P15)

Recommendations

• On the complexity of the normal bases via prime Gauss period over finite fields
• scientific article; zbMATH DE number 6452443
• Gauss periods as constructions of low complexity normal bases
• Dual and trace bases of the type (4,7) Gauss period normal basis over finite fields
• Normal bases via general Gauss periods

Cites work

• Algorithms for exponentiation in finite fields
• Complete solution of the cyclotomic problem in F_q for any prime modulus l, q = p^α, p ≡ 1 (mod l)
• Cyclotomic numbers of order 2l, l an odd prime
• Cyclotomy, Higher Congruences, and Waring's Problem
• Gauss periods as constructions of low complexity normal bases
• scientific article; zbMATH DE number 4154569 (Why is no real title available?)
• scientific article; zbMATH DE number 6452443 (Why is no real title available?)
• Jacobi sums and cyclotomic numbers of order l^2
• Optimal normal bases in \(GF(p^ n)\)
• The Cyclotomic Numbers of Order Eighteen with Applications to Difference Sets
• The cyclotomic numbers of order fourteen
• The cyclotomic numbers of order twelve

Cited in

(8)

• Multiplicative orders of Gauss periods and the arithmetic of real quadratic fields
• Dual and trace bases of the type (4,7) Gauss period normal basis over finite fields
• Normal bases via general Gauss periods
• scientific article; zbMATH DE number 6452443 (Why is no real title available?)
• Abelian groups, Gauss periods, and normal bases
• Gauss periods as constructions of low complexity normal bases
• An approach to normal polynomials through symmetrization and symmetric reduction
• On the complexity of the normal bases via prime Gauss period over finite fields

This page was built for publication: Complexities of normal bases constructed from Gauss periods

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