Results 1  10
of
16
Generators and irreducible polynomials over finite fields
 Mathematics of Computation
, 1997
"... Abstract. Weil’s character sum estimate is used to study the problem of constructing generators for the multiplicative group of a finite field. An application to the distribution of irreducible polynomials is given, which confirms an asymptotic version of a conjecture of HansenMullen. 1. ..."
Abstract

Cited by 23 (5 self)
 Add to MetaCart
(Show Context)
Abstract. Weil’s character sum estimate is used to study the problem of constructing generators for the multiplicative group of a finite field. An application to the distribution of irreducible polynomials is given, which confirms an asymptotic version of a conjecture of HansenMullen. 1.
Normal Bases over Finite Fields
, 1993
"... Interest in normal bases over finite fields stems both from mathematical theory and practical applications. There has been a lot of literature dealing with various properties of normal bases (for finite fields and for Galois extension of arbitrary fields). The advantage of using normal bases to repr ..."
Abstract

Cited by 18 (0 self)
 Add to MetaCart
(Show Context)
Interest in normal bases over finite fields stems both from mathematical theory and practical applications. There has been a lot of literature dealing with various properties of normal bases (for finite fields and for Galois extension of arbitrary fields). The advantage of using normal bases to represent finite fields was noted by Hensel in 1888. With the introduction of optimal normal bases, large finite fields, that can be used in secure and e#cient implementation of several cryptosystems, have recently been realized in hardware. The present thesis studies various theoretical and practical aspects of normal bases in finite fields. We first give some characterizations of normal bases. Then by using linear algebra, we prove that F q n has a basis over F q such that any element in F q represented in this basis generates a normal basis if and only if some groups of coordinates are not simultaneously zero. We show how to construct an irreducible polynomial of degree 2 n with linearly i...
Coefficients of primitive polynomials over finite fields
 Math. Comp
, 1996
"... ..."
(Show Context)
Constructing Normal Bases in Finite Fields
 J. Symbolic Comput
, 1990
"... This paper addresses the question: how can we find a normal element efficiently? More generally, we consider how to find an element of any given additive order. Hensel (1888) pioneered the study of normal bases for finite fields and proved that they always exist. We use his algorithm in Section 2. E ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
(Show Context)
This paper addresses the question: how can we find a normal element efficiently? More generally, we consider how to find an element of any given additive order. Hensel (1888) pioneered the study of normal bases for finite fields and proved that they always exist. We use his algorithm in Section 2. Eisenstein (1850) had already noted that normal bases always exist. Hensel, and also Ore (1934), determine exactly the number of these bases, and Ore develops the more general concept of additive order. Ore's approach is developed into more constructive proofs of the normal basis theorem in several textbooks (for example, van der Waerden 1966, Section 67, and Albert 1956, Section 4.15); these all use some linear algebra calculations. Schwarz (1988) has given a new proof along these lines, and several recent papers have translated this approach into algorithms. Sidel'nikov (1988) deals with the case where n divides one of p (the characteristic of F q ), q + 1, or
A polynomial description of the Rijndael advanced encryption standard
 J. Algebra Appl
, 1949
"... The paper gives a polynomial description of the Rijndael Advanced Encryption Standard recently adopted by the National Institute of Standards and Technology. Special attention is given to the structure of the SBox. ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
(Show Context)
The paper gives a polynomial description of the Rijndael Advanced Encryption Standard recently adopted by the National Institute of Standards and Technology. Special attention is given to the structure of the SBox.
Permutation Groups, ErrorCorrecting Codes and Uncoverings
, 2005
"... We replace the traditional setting for errorcorrecting codes (i.e. linear codes) with that of permutation groups, with permutations in list form as the codewords. We introduce a decoding algorithm for these codes, which uses the following notion. A base for a permutation group is a sequence of poin ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
We replace the traditional setting for errorcorrecting codes (i.e. linear codes) with that of permutation groups, with permutations in list form as the codewords. We introduce a decoding algorithm for these codes, which uses the following notion. A base for a permutation group is a sequence of points whose stabiliser is trivial. An uncoveringbybases (or UBB) is a set of bases such that any combination of error positions is avoided by at least one base in the set. In the case of sharply ktransitive groups, any ktuple of points forms a base, so a UBB can be formed from the complements of the blocks of a covering design. (In this case, we use the term uncovering.) A large part of the thesis (chapters 2 to 5) is concerned with constructing UBBs for groups which are basetransitive, i.e. which act transitively on their irredundant bases, which were classified by T. Maund. Various combinatorial, algebraic and numbertheoretic techniques are employed in this. Other topics include a case study of the Mathieu group M12, where we investigate ways in which
Primitive free cubics with specified norm and trace
 TRANSACTIONS OF AMERICAN MATHEMATICAL SOCIETY
, 2003
"... The existence of a primitive free (normal) cubic x 3 − ax 2 + cx − b over a finite field F with arbitrary specified values of a (�=0)andb (primitive) is guaranteed. This is the most delicate case of a general existence theorem whose proof is thereby completed. ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
The existence of a primitive free (normal) cubic x 3 − ax 2 + cx − b over a finite field F with arbitrary specified values of a (�=0)andb (primitive) is guaranteed. This is the most delicate case of a general existence theorem whose proof is thereby completed.
Finite Fields in AXIOM
, 1992
"... Finite fields play an important role for many applications (e.g. coding theory, cryptography). There are different ways to construct a finite field for a given prime power. The paper describes the different constructions implemented in AXIOM. These are polynomial basis representation, cyclic group r ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
Finite fields play an important role for many applications (e.g. coding theory, cryptography). There are different ways to construct a finite field for a given prime power. The paper describes the different constructions implemented in AXIOM. These are polynomial basis representation, cyclic group representation, and normal basis representation. Furthermore, the concept of the implementation, the used algorithms and the various datatype coercions between these representations are discussed.