Related papers: Counting points on varieties over finite fields of…

We describe a provably quasi-polynomial algorithm to compute discrete logarithms in the multiplicative groups of finite fields of small characteristic, that is finite fields whose characteristic is logarithmic in the order. We partially…

We calculate the discrete moments of the characteristic polynomial of a random unitary matrix, evaluated a small distance away from an eigenangle. Such results allow us to make conjectures about similar moments for the Riemann zeta…

A survey on algorithms for computing discrete logarithms in Jacobians of curves over finite fields.

We derive formulas for the number of points on the basic stratum of certain Kottwitz varieties in terms of automorphic representations and certain explicit polynomials, for which we present efficient algorithms for computation. We obtain…

If K/k is a function field in one variable of positive characteristic, we describe a general algorithm to factor one-variable polynomials with coefficients in K. The algorithm is flexible enough to find factors subject to additional…

In recent algorithms that use deformation in order to compute the number of points on varieties over a finite field, certain differential equations of matrices over p-adic fields emerge. We present a novel strategy to solve this kind of…

Let g >= 1 and let Q be a monic, squarefree polynomial of degree 2g + 1 in Z[x]. For an odd prime p not dividing the discriminant of Q, let Z_p(T) denote the zeta function of the hyperelliptic curve of genus g over the finite field F_p…

We give an explicit formula of the coefficients of the Zeta-Function's L-polynomial for algebraic function fields over finite constant fields. Thus, we deduce an expression of the class number of algebraic function fields defined over…

We give an algorithm to determine factorization types of primes in the number fields generated by a single point of odd order on an elliptic curve. We apply this to compute coefficients of the Dedekind zeta function of the field.

In this article we prove lower and upper bounds for class numbers of algebraic curves defined over finite fields. These bounds turn out to be better than most of the previously known bounds obtained using combinatorics. The methods used in…

This note provides new methods for constructing quadratic nonresidues in finite fields of characteristic p. It will be shown that there is an effective deterministic polynomial time algorithm for constructing quadratic nonresidues in finite…

We present a new method for computing the zeta function of an algebraic curve over a finite field. The algorithm relies on a trace formula of Harvey to count points on a plane model of the curve. The zeta function of the curve is then…

We introduce and study new versions of polylogarithms and a zeta function on a completion of $\mathbb F_q (x)$ at a finite place. The construction is based on the use of the Carlitz differential equations for $\mathbb F_q$-linear functions.

We determine the zeta functions of trinomial curves in terms of Gauss sums and Jacobi sums, and we obtain an explicit formula of the genus of a trinomial curve over a finite field, then we study the conditions for a trinomial curve to be a…

Partial zeta functions of algebraic varieties over finite fields generalize the classical zeta function by allowing each variable to be defined over a possibly different extension field of a fixed finite field. Due to this extra variation…

Using the cohomology theory of Dwork, as developed by Adolphson and Sperber, we exhibit a deterministic algorithm to compute the zeta function of a nondegenerate hypersurface defined over a finite field. This algorithm is particularly…

We present a new method for constructing genus 2 curves over a finite field with a given number of points on its Jacobian. This method has important applications in cryptography, where groups of prime order are used as the basis for…

Combining the idea of motivic zeta function, due to Kapranov, and Pellikaan's definition of a two- variable zeta function for curves over finite fields in the present note we introduce a motivic two- variable zeta function for curves over…

Let E_G be a family of hyperelliptic curves defined by Y^2=Q(X,G), where Q is defined over a small finite field of odd characteristic. Then with g in an extension degree n field over this small field, we present a deterministic algorithm…

We describe an algorithm to compute the zeta-function of a proper, smooth curve over a finite field, when the curve is given together with some auxiliary data. Our method is based on computing the matrix of the action of a semi-linear…