Abelian Groups, Gauss Periods, and Normal Bases

Authors:
Shuhong Gao
Affiliations:
Department of Mathematical Sciences, Clemson University, Clemson, South Carolina, 296340975, f1sgao@math.clemson.eduf1
Venue:
Finite Fields and Their Applications
Year:
2001

Citing 10
Cited 2

Finding irreducible polynomials over finite fields

STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Optimal normal bases in GF(pn)

Discrete Applied Mathematics
Low complexity normal bases

Discrete Applied Mathematics
Optimal normal bases

Designs, Codes and Cryptography
Normal and Self-dual Normal Bases from Factorization of$c x^{q+1} + d x^{q} - ax - b$

SIAM Journal on Discrete Mathematics
On orders of optimal normal basis generators

Mathematics of Computation
Gauss periods: orders and cryptographical applications

Mathematics of Computation
Normal bases via general Gauss periods

Mathematics of Computation
Algorithms for exponentiation in finite fields

Journal of Symbolic Computation
An implementation of elliptic curve cryptosystems over F2155

IEEE Journal on Selected Areas in Communications

Fast arithmetic with general Gauß periods

Theoretical Computer Science - Algebraic and numerical algorithm
Low complexity of a class of normal bases over finite fields

Finite Fields and Their Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

A result on finite abelian groups is first proved and then used to solve problems in finite fields. Particularly, all finite fields that have normal bases generated by general Gauss periods are characterized and it is shown how to find normal bases of low complexity.