Background Elliptic curve cryptographic schemes were proposed independently in 1985 by
Neal Koblitz (Koblitz 1987) and Victor Miller (Miller 1986). They are the elliptic curve …

Structural Macroeconometrics provides a thorough overview and in-depth exploration of
methodologies, models, and techniques used to analyze forces shaping national …

Modular forms are tremendously important in various areas of mathematics, from number
theory and algebraic geometry to combinatorics and lattices. Their Fourier coefficients, with …

We present a deterministic polynomial time algorithm for computing the zeta function of an
arbitrary variety of fixed dimension over a finite field of small characteristic. One …

Coleman's theory of p-adic integration figures prominently in several number-theoretic
applications, such as finding torsion and rational points on curves, and computing p-adic …

Let g≥ 1, and let Q∈ Z [x] be a monic, squarefree polynomial of degree 2g+ 1. For an odd
prime p not dividing the discriminant of Q, let Zp (T) denote the zeta function of the …

We introduce a new algorithm to compute the zeta function of a curve over a finite field. This
method extends previous work of ours to all curves for which a good lift to characteristic zero …

Deformation theory and the computation of zeta functions Page 1 DEFORMATION THEORY
AND THE COMPUTATION OF ZETA FUNCTIONS ALAN GB LAUDER 1. Introduction An …

We introduce a new algorithm to compute the zeta function of a curve over a finite field. This
method extends Kedlaya's algorithm to a very general class of curves using a map to the …

We present ap-adic algorithm to compute the zeta function of a nondegenerate curve over a
finite field using Monsky-Washnitzer cohomology. The paper vastly generalizes previous …