Add to ORKGWe obtain a lower bound on the multiplicative order of Gauss periods which generate normal bases over finite fields. This bound improves the previous bound of J. von zur Gathen and I. E. Shparlin-ski.
International audienceWe construct two new families of basis for finite field extensions. Basis in t...
International audienceWe construct two new families of basis for finite field extensions. Basis in t...
International audienceWe construct two new families of basis for finite field extensions. Basis in t...
We obtain a lower bound on the multiplicative order of Gauss periods which generate normal bases ove...
AbstractWe obtain explicit lower bounds on multiplicative orders of finite field elements that have ...
AbstractA result on finite abelian groups is first proved and then used to solve problems in finite ...
Gauss periods can be used to implement finite field arithmetic efficiently. For a small prime p and ...
Gauss periods have been used successfully as a tool for constructing normal bases in finite fields. ...
It is shown that Gauss periods of special type give an explicit polynomial-time computation of eleme...
AbstractWe obtain explicit lower bounds on multiplicative orders of finite field elements that have ...
Gauss periods yield (self-dual) normal bases in finite fields, and these normal bases can be used to...
AbstractA result on finite abelian groups is first proved and then used to solve problems in finite ...
AbstractWe construct two new families of basis for finite field extensions. Bases in the first famil...
AbstractLet K be a cyclic Galois extension of Q of finite degree. We give two algorithms to construc...
AbstractLet K/Q be a cyclic extension of degree n of prime conductor p. The field K over Q has a nor...
International audienceWe construct two new families of basis for finite field extensions. Basis in t...
International audienceWe construct two new families of basis for finite field extensions. Basis in t...
International audienceWe construct two new families of basis for finite field extensions. Basis in t...
We obtain a lower bound on the multiplicative order of Gauss periods which generate normal bases ove...
AbstractWe obtain explicit lower bounds on multiplicative orders of finite field elements that have ...
AbstractA result on finite abelian groups is first proved and then used to solve problems in finite ...
Gauss periods can be used to implement finite field arithmetic efficiently. For a small prime p and ...
Gauss periods have been used successfully as a tool for constructing normal bases in finite fields. ...
It is shown that Gauss periods of special type give an explicit polynomial-time computation of eleme...
AbstractWe obtain explicit lower bounds on multiplicative orders of finite field elements that have ...
Gauss periods yield (self-dual) normal bases in finite fields, and these normal bases can be used to...
AbstractA result on finite abelian groups is first proved and then used to solve problems in finite ...
AbstractWe construct two new families of basis for finite field extensions. Bases in the first famil...
AbstractLet K be a cyclic Galois extension of Q of finite degree. We give two algorithms to construc...
AbstractLet K/Q be a cyclic extension of degree n of prime conductor p. The field K over Q has a nor...
International audienceWe construct two new families of basis for finite field extensions. Basis in t...
International audienceWe construct two new families of basis for finite field extensions. Basis in t...
International audienceWe construct two new families of basis for finite field extensions. Basis in t...