AbstractWe obtain explicit lower bounds on multiplicative orders of finite field elements that have more general form than Gauss periods of a special type. This bound improves in a partial case of Gauss period the previous bound of Ahmadi, Shparlinski and Voloch (2010) [2]
AbstractA lower bound is computed for the number of elements of a finite field F represented by a1x1...
AbstractWe give a conjectural deterministic algorithm for computing primitive elements of extensions...
AbstractConsider an extension field Fqm=Fq(α) of the finite field Fq. Davenport proved that the set ...
AbstractWe obtain explicit lower bounds on multiplicative orders of finite field elements that have ...
We consider elements which are both of high multiplicative order and normal in extensions Fqm of the...
AbstractIn numerous applications involving finite fields, we often need high-order elements. Ideally...
We give a lower bound on multiplicative orders of certain elements in defined by Conway towers of fi...
It is shown that Gauss periods of special type give an explicit polynomial-time computation of eleme...
We obtain a lower bound on the multiplicative order of Gauss periods which generate normal bases ove...
We obtain a lower bound on the multiplicative order of Gauss periods which generate normal bases ove...
Abstract. In this paper, we recursively construct explicit elements of provably high order in finite...
Gauss periods can be used to implement finite field arithmetic efficiently. For a small prime p and ...
AbstractUsing bounds of character sums we show that one of the open questions about the possible rel...
AbstractIn numerous applications involving finite fields, we often need high-order elements. Ideally...
We illustrate a general technique to construct towers of fields producing high order elements in Fq2...
AbstractA lower bound is computed for the number of elements of a finite field F represented by a1x1...
AbstractWe give a conjectural deterministic algorithm for computing primitive elements of extensions...
AbstractConsider an extension field Fqm=Fq(α) of the finite field Fq. Davenport proved that the set ...
AbstractWe obtain explicit lower bounds on multiplicative orders of finite field elements that have ...
We consider elements which are both of high multiplicative order and normal in extensions Fqm of the...
AbstractIn numerous applications involving finite fields, we often need high-order elements. Ideally...
We give a lower bound on multiplicative orders of certain elements in defined by Conway towers of fi...
It is shown that Gauss periods of special type give an explicit polynomial-time computation of eleme...
We obtain a lower bound on the multiplicative order of Gauss periods which generate normal bases ove...
We obtain a lower bound on the multiplicative order of Gauss periods which generate normal bases ove...
Abstract. In this paper, we recursively construct explicit elements of provably high order in finite...
Gauss periods can be used to implement finite field arithmetic efficiently. For a small prime p and ...
AbstractUsing bounds of character sums we show that one of the open questions about the possible rel...
AbstractIn numerous applications involving finite fields, we often need high-order elements. Ideally...
We illustrate a general technique to construct towers of fields producing high order elements in Fq2...
AbstractA lower bound is computed for the number of elements of a finite field F represented by a1x1...
AbstractWe give a conjectural deterministic algorithm for computing primitive elements of extensions...
AbstractConsider an extension field Fqm=Fq(α) of the finite field Fq. Davenport proved that the set ...
DOI
Add to ORKG