29,010 research outputs found
Efficient multiplication in binary fields
The thesis discusses the basics of efficient multiplication in finite fields,
especially in binary fields. There are two broad approaches: polynomial representation and normal bases, used in software and hardware implementations,
respectively. Due to the advantages of normal bases of low complexity, there is
also a brief introduction to constructing optimal normal bases. Furthermore, as
irreducible polynomials are of fundamental importance for finite fields, the thesis
concludes with some irreducibility test
Computing a Gröbner basis of a polynomial ideal over a Euclidean domain
AbstractAn algorithm for computing a Gröbner basis of a polynomial ideal over a Euclidean domain is presented. The algorithm takes an ideal specified by a finite set of polynomials as its input; it produces another finite basis of the same ideal with the properties that using this basis, every polynomial in the ideal reduces to 0 and every polynomial in the polynomial ring reduces to a unique normal form. The algorithm is an extension of Buchberger's algorithms for computing Gröbner bases of polynomial ideals over an arbitrary field and over the integers as well as our algorithms for computing Gröbner bases of polynomial ideals over the integers and the Gaussian integers. The algorithm is simpler than other algorithms for polynomial ideals over a Euclidean domain reported in the literature; it is based on a natural way of simplifying polynomials by another polynomial using Euclid's division algorithm on the coefficients in polynomials. The algorithm is illustrated by showing how to compute Gröbner bases for polynomial ideals over the integers, the Gaussian integers as well as over algebraic integers in quadratic number fields admitting a division algorithm. A general theorem exhibiting the uniqueness of a reduced Gröbner basis of an ideal, determined by an admissible ordering on terms (power products) and other conditions, is discussed
Singular Higher-Order Complete Vector Bases for Finite Methods
This paper presents new singular curl- and divergence- conforming vector bases that incorporate the edge conditions. Singular bases complete to arbitrarily high order are described in a unified and consistent manner for curved triangular and quadrilateral elements. The higher order basis functions are obtained as the product of lowest order functions and Silvester-Lagrange interpolatory polynomials with specially arranged arrays of interpolation points. The completeness properties are discussed and these bases are proved to be fully compatible with the standard, high-order regular vector bases used in adjacent elements. The curl (divergence) conforming singular bases guarantee tangential (normal) continuity along the edges of the elements allowing for the discontinuity of normal (tangential) components, adequate modeling of the curl (divergence), and removal of spurious modes (solutions). These singular high-order bases should provide more accurate and efficient numerical solutions of both surface integral and differential problems. Sample numerical results confirm the faster convergence of these bases on wedge problems
Multiplicative Order of Gauss Periods
We 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. Shparlinski.Comment: 9 page
Elliptic periods for finite fields
We construct two new families of basis for finite field extensions. Basis in
the first family, the so-called elliptic basis, are not quite normal basis, but
they allow very fast Frobenius exponentiation while preserving sparse
multiplication formulas. Basis in the second family, the so-called normal
elliptic basis are normal basis and allow fast (quasi linear) arithmetic. We
prove that all extensions admit models of this kind
- âŠ