Related papers: Computing cardinalities of Q-curve reductions over…

We classify elliptic curves over the rationals whose N\'eron model over the integers is semi-abelian, with good reduction at p=2, and whose Mordell--Weil group contains an element of order two that stays non-trivial at p=2. Furthermore, we…

We describe an algorithm to count the number of rational points of an hyperelliptic curve defined over a finite field of odd characteristic which is based upon the computation of the action of the Frobenius morphism on a basis of the…

We discuss the computation of coefficients of the L-series associated to a hyperelliptic curve over Q of genus at most 3, using point counting, generic group algorithms, and p-adic methods.

In this paper, we intend to study the geometric meaning of the discrete logarithm problem defined over an Elliptic Curve. The key idea is to reduce the Elliptic Curve Discrete Logarithm Problem (EC-DLP) into a system of equations. These…

We extend our method to compute division polynomials of Jacobians of curves over Q to curves over Q(t), in view of computing mod ell Galois representations occurring in the \'etale cohomology of surfaces over Q. Although the division…

Let O be a maximal order in the quaternion algebra B_p over Q ramified at p and infinity. The paper is about the computational problem: Construct a supersingular elliptic curve E over F_p such that End(E) = O. We present an algorithm that…

An efficient integer factorization algorithm would reduce the security of all variants of the RSA cryptographic scheme to zero. Despite the passage of years, no method for efficiently factoring large semiprime numbers in a classical…

We present algorithms which, given a genus 2 curve $C$ defined over a finite field and a quartic CM field $K$, determine whether the endomorphism ring of the Jacobian $J$ of $C$ is the full ring of integers in $K$. In particular, we present…

Let $\mathbb{F}_q$ denote the finite field with $q$ elements. In this work, we use characters to give the number of rational points on suitable curves of low degree over $\mathbb{F}_q$ in terms of the number of rational points on elliptic…

Let E be an elliptic curve without complex multiplication (CM) over a number field K, and let G_E(ell) be the image of the Galois representation induced by the action of the absolute Galois group of K on the ell-torsion subgroup of E. We…

We prove that, on average, elliptic curves over Q have finitely many primes p for which they possess a p-adic point of order p. We include a discussion of applications to companion forms and the deformation theory of Galois representations.

Let k be a finite field of odd characteristic. We find a closed formula for the number of k-isomorphism classes of pointed, and non-pointed, hyperelliptic curves of genus g over k, admitting a Koblitz model. These numbers are expressed as a…

Given an elliptic curve $E$ and a positive integer $N$, we consider the problem of counting the number of primes $p$ for which the reduction of $E$ modulo $p$ possesses exactly $N$ points over $\mathbb F_p$. On average (over a family of…

Curves over finite fields are of great importance in cryptography and coding theory. Through studying their zeta-functions, we would be able to find out vital arithmetic and geometric information about them and their Jacobians, including…

We present e cient algorithms for computing isogenies between hyperelliptic curves, leveraging higher genus curves to enhance cryptographic protocols in the post-quantum context. Our algorithms reduce the computational complexity of isogeny…

A new algorithms for computing discrete logarithms on elliptic curves defined over finite fields is suggested. It is based on a new method to find zeroes of summation polynomials. In binary elliptic curves one is to solve a cubic system of…

Let E be an elliptic curve over Q, and let n=>1. The central object of study of this article is the division field Q(E[n]) that results by adjoining to Q the coordinates of all n-torsion points on E(Q). In particular, we classify all curves…

This article is a short introduction to the theory of the groups of points of elliptic curves over finite fields. It is concerned with the elementary theory and practice of elliptic curves cryptography, the new generation of public key…

We describe an algorithm to compute the number of points over finite fields on a broad class of modular curves: we consider quotients $X_H/W$ for $H$ a subgroup of $\GL_2(\mathbb Z/n\mathbb Z)$ such that for each prime $p$ dividing $n$, the…

Elliptic curves with a known number of points over a given prime field with n elements are often needed for use in cryptography. In the context of primality proving, Atkin and Morain suggested the use of the theory of complex multiplication…