Related papers: Efficient computation of universal elliptic Gau{\s…
We present new ideas for computing elliptic Gau{\ss} sums, which constitute an analogue of the classical cyclotomic Gau{\ss} sums and whose use has been proposed in the context of counting points on elliptic curves and primality tests. By…
This work builds on earlier results. We define universal elliptic Gau{\ss} sums for Atkin primes in Schoof's algorithm for counting points on elliptic curves. Subsequently, we show these quantities admit an efficiently computable…
We present a simple and efficient algorithm to compute the sum of the algebraic conjugates of a point on an elliptic curve.
We describe algorithms to compute elliptic functions and their relatives (Jacobi theta functions, modular forms, elliptic integrals, and the arithmetic-geometric mean) numerically to arbitrary precision with rigorous error bounds for…
We present a new approach to handling the case of Atkin primes in Schoof's algorithm for counting points on elliptic curves over finite fields. Our approach is based on the theory of polynomially cyclic algebras, which we recall as far as…
Elliptic functions are largely studied and standardized mathematical objects. The two usual approaches are due to Jacobi and Weierstrass. From a contour integral which allowed us to unify many summation formulae (Euler-MacLaurin, Poisson,…
We present a detailed analysis of how to implement the computation of modular symbols for a given elliptic curve by using numerical approximations. This method turns out to be more efficient than current implementation as the conductor of…
In this paper, we present efficient algorithms for computing the number of points and the order of the Jacobian group of a superelliptic curve over finite fields of prime order p. Our method employs the Hasse-Weil bounds in conjunction with…
We present an efficient quantum algorithm for estimating Gauss sums over finite fields and finite rings. This is a natural problem as the description of a Gauss sum can be done without reference to a black box function. With a reduction…
Jacobi sums and cyclotomic numbers are the important objects in number theory. The determination of all the Jacobi sums and cyclotomic numbers of order $e$ are merely intricate to compute. This paper presents the lesser numbers of Jacobi…
This is a book about computational aspects of modular forms and the Galois representations attached to them. The main result is the following: Galois representations over finite fields attached to modular forms of level one can, in almost…
We present normal forms for elliptic curves over a field of characteristic $2$ analogous to Edwards normal form, and determine bases of addition laws, which provide strikingly simple expressions for the group law. We deduce efficient…
The arithmetic of elliptic curves, namely polynomial addition and scalar multiplication, can be described in terms of global sections of line bundles on $E\times E$ and $E$, respectively, with respect to a given projective embedding of $E$…
In the article we outline the set of Matlab functions that enable the computation of elliptic Integrals and Jacobian elliptic functions for real arguments. Correctness, robustness, efficiency and accuracy of the functions are discussed in…
This paper develops new combinatorial approaches to analyze and compute special set partitions, called complementary set partitions, which are fundamental in the study of generalized cumulants. Moving away from traditional graph-based and…
The paper presents a method to compute the Jacobi's elliptic function \texttt{sn} on the period parallelogram. For fixed $m$ it requires first to compute the complete elliptic integrals $K=K(m)$ and $K'=K(1-m).$ The Newton method is used to…
We show how to speed up the computation of isomorphisms of hyperelliptic curves by using covariants. We also obtain new theoretical and practical results concerning models of these curves over their field of moduli.
This article gives an introduction for mathematicians interested in numerical computations in algebraic geometry and number theory to some recent progress in algorithmic number theory, emphasising the key role of approximate computations…
Let $C$ be a curve of genus $g$ over a field $k$. We describe probabilistic algorithms for addition and inversion of the classes of rational divisors in the Jacobian of $C$. After a precomputation, which is done only once for the curve $C$,…
We present several new heuristic algorithms to compute class polynomials and modular polynomials modulo a prime $p$ by revisiting the idea of working with supersingular elliptic curves. The best known algorithms to this date are based on…