Related papers: Using zeta functions to factor polynomials over fi…

Permutation polynomials are an interesting subject of mathematics and have applications in other areas of mathematics and engineering. In this paper, we develop general theorems on permutation polynomials over finite fields. As a…

We interpret the "explicit formulas" in the sense of analytic number theory for the zeta function of an elliptic curve over a finite field as a transversal index theorem on a 3-dimensional laminated space.

Let $\mathbb{F}_q$ denote the finite field of $q$ elements with characteristic $p$. Let $\mathbb{Z}_q$ denote the unramified extension of the $p$-adic integers $\mathbb{Z}_p$ with residue field $\mathbb{F}_q$. In this paper, we investigate…

We present a polynomial-time pseudo-deterministic algorithm for constructing irreducible polynomial of degree $d$ over finite field $\mathbb{F}_q$. A pseudo-deterministic algorithm is allowed to use randomness, but with high probability it…

This is an integrated part of our Geo-Arithmetic Program. In this paper we initiate a geometrically oriented construction of non-abelian zeta functions for curves defined over finite fields by a weighted count of semi-stable bundles. Basic…

We consider a quantum polynomial-time algorithm which solves the discrete logarithm problem for points on elliptic curves over $GF(2^m)$. We improve over earlier algorithms by constructing an efficient circuit for multiplying elements of…

The Function Field Sieve algorithm is dedicated to computing discrete logarithms in a finite field GF(q^n), where q is small an prime power. The scope of this article is to select good polynomials for this algorithm by defining and…

We explain how to use computer experiments over finite fields to gain heuristic information about the solution set of polynomial equations in characteristic zero. These are notes of a tutorial I gave at the NATO Advanced Study Institute on…

In the work we propose an algorithm for a Wiener -- Hopf factorization of scalar polynomials based on notions of indices and essential polynomials. The algorithm uses computations with finite Toeplitz matrices and permits to obtain…

Numerous results on self-reciprocal polynomials over finite fields have been studied. In this paper we generalize some of these to a-self reciprocal polynomials defined in [4]. We consider some properties of the divisibility of a-reciprocal…

This paper describes an algorithm which computes the characteristic polynomial of a matrix over a field within the same asymptotic complexity, up to constant factors, as the multiplication of two square matrices. Previously, this was only…

We describe a quasi-linear algorithm for computing Igusa class polynomials of Jacobians of genus 2 curves via complex floating-point approximations of their roots. After providing an explicit treatment of the computations in quartic CM…

This article concerns the computational complexity of a fundamental problem in number theory: counting points on curves and surfaces over finite fields. There is no subexponential-time algorithm known and it is unclear if it can be…

Let $k,p\in \mathbb{N}$ with $p$ prime and let $f\in\mathbb{Z}[x_1,x_2]$ be a bivariate polynomial with degree $d$ and all coefficients of absolute value at most $p^k$. Suppose also that $f$ is variable separated, i.e., $f=g_1+g_2$ for…

We propose a randomized polynomial time algorithm for computing nontrivial zeros of quadratic forms in 4 or more variables over $\mathbb{F}_q(t)$, where $\mathbb{F}_q$ is a finite field of odd characteristic. The algorithm is based on a…

In this paper we present a polynomial time algorithm to compute the local zeta function Z(s,f) attached to a polynomial f(x) in Z[x] (in one variable, with splitting field Q) and a prime p. The algorithm reduces in polynomial time the…

In a recent paper Z\'u\~niga-Galindo and the author begun the study of the local zeta functions for Laurent polynomials. In this work we continue this study by giving a very explicit formula for the local zeta function associated to a…

We present a new algorithm for computing the endomorphism ring of an ordinary abelian surface over a finite field which is subexponential and generalizes an algorithm of Bisson and Sutherland for elliptic curves. The correctness of this…

We show that it is possible to approximate the zeta-function of a curve over a finite field by meromorphic functions which satisfy the same functional equation and moreover satisfy (respectively do not satisfy) the analogue of the Riemann…

Elliptic curves over finite fields with predefined conditions in the order are practically constructed using the theory of complex multiplication. The stage with longest calculations in this method reconstructs some polynomial with integer…