Finite Fields: Theory and Applications

  • Joachim von zur Gathen

    Universität Bonn, Germany
  • Igor E. Shparlinski

    University of New South Wales, Sydney, Australia
  • Henning Stichtenoth

    Universität Duisburg-Essen, Germany
Finite Fields: Theory and Applications cover
Download PDF

A subscription is required to access this article.


The workshop \emph{Finite Fields: Theory and Applications} was organized by Joachim von zur Gathen (Bonn), Igor Shparlinski (Sydney), and Henning Stichtenoth (Essen), and ran from 5 to 11 December 2004. Its forty participants, with a wide geographical distribution, enjoyed the hospitality of the Mathematical Research Institute, and its beautiful surroundings. Two previous meetings on the topic had been held in 1997 and 2001. The schedule consisted of three plenary talks each morning, and specialized sessions later in the day, with vast time for discussions and collaborative work. The traditional Wednesday afternoon hike was blessed with wonderful sunny weather and the compulsory Black Forest cake reward at the end. Very broadly, we can distinguish seven subject areas: \begin{itemize} \item structure of finite fields, \item field towers, \item points on varieties, \item error-correcting codes, \item computation, \item combinatorics, \item cryptography. \end{itemize} Of course, many of the results presented bridge between two or more of these areas. The abstracts that follow speak for themselves. Avoiding an exhaustive discussion, we now mention one particular talk from each of the seven areas. The \emph{structure theory} includes questions about polynomials. The well-known Hansen-Mullen conjecture (whose second author was in the audience) was stated in 1992 and asserts that for any finite field Fq\mathbb F_{q}, integers nn and mm with 0<m<n0 < m < n and aFqa \in \mathbb F_{q}, there exists a monic primitive polynomial in Fq[x]\mathbb F_{q}[x] of degree nn having aa as the coefficient of xmx^{m}; there are a few well-known exceptional cases where this fails to hold. Cohen presented a proof of this conjecture at degrees n9n \ge 9, assuring the audience that smaller values of nn are also under consideration. \emph{Towers of function fields} are of great interest because they may yield good algebraic-geometric codes. Beelen introduced a recursive construction of such towers, using a certain type of Fuchsian differential equations. They can be obtained from modular curves, and in some cases can be shown to be asymptotically optimal (in terms of the parameters of the resulting codes). A conjecture concerning \emph{points on varieties} was stated by Heath-\-Brown. Name\-ly, he considers a nonsingular nonlinear hypersurface XX in Pn\mathbb P^{n} defined over Q\mathbb Q, considers the number N(B)N(B) of points on XX with rational integral coefficients absolutely bounded by BB, and conjectures that this number is O(Bn1+ϵ)O(B^{n-1+\epsilon}) for any positive ϵ\epsilon. Browning presented his proof of this conjecture in all cases, with the possible exceptions d=3,4d = 3,4 and n=7,8n = 7,8. In the theory of \emph{error-correcting codes}, finite fields were fundamental from its beginning in the 1940s. Their importance was heightened by the construction of codes from algebraic curves over finite fields. Voloch discussed a different connection: the quadratic residue codes. It is unknown whether subfamilies of them can yield asymptotically good codes. Voloch showed that there exist subfamilies that do not yield good codes. This is based on an expression of the minimal distance by exponential sums, due to Helleseth, and estimates on the smallest prime that splits completely in a number field. For \emph{computation}, a difficult class of objects are bivariate polynomials presented in a particularly generous format, namely as a sum of terms where the exponents are written in binary (or decimal). Thus we look at polynomials of humongous degrees. Kaltofen presented two results which illuminate the wide range of behavior for questions about such polynomials. Over the rational numbers, he can compute the linear and quadratic factors in polynomial time. Over a large finite field, testing irreducibility is NP-hard (under randomized reductions). As a question from \emph{combinatorics}, we give the following illustrative example. A sum-free set AA in an additive group GG is such that x+yzx+y \not= z for all x,y,zAx, y, z \in A. For instance the additive group G=ZpG = \mathbb Z_{p} for a prime pp and A={n,n+1,,2n1}A=\{n, n+1, \ldots, 2n-1\} for n=(p+1)/3n= \lfloor (p+1)/3 \rfloor is a sum-free set. We can also multiply each element of AA by a fixed nonzero element of Zp\mathbb Z_{p}. When p2mod3p \equiv 2 \bmod 3, no other sum-free subsets of Zp\mathbb Z_{p} exist. Lev shows that assumption #A0.33p\#A \geq 0.33p implies that AA is contained in the corresponding interval or a dilation of it. In \emph{cryptography}, a central question is the conjectured difficulty of computing the discrete logarithm in certain groups. The method of index calculus provides a subexponential algorithm in the unit groups of finite fields. Elliptic curves owe their popularity in cryptography to the absence, so far, of any discrete logarithm computation of comparable efficiency. Semaev presented an approach, rather speculative at this point, aimed at finding such a method; it works with the new notion of summation polynomials which vanish at the xx-coordinates of points that sum to 00 on the curve.

Cite this article

Joachim von zur Gathen, Igor E. Shparlinski, Henning Stichtenoth, Finite Fields: Theory and Applications. Oberwolfach Rep. 1 (2004), no. 4, pp. 2913–2970

DOI 10.4171/OWR/2004/54