Related papers: A CRT algorithm for constructing genus 2 curves ov…

In this article we give an algorithm for the computation of the number of rational points on the Jacobian variety of a generic ordinary hyperelliptic curve defined over a finite field of cardinality $q$ with time complexity $O(n^{2+o(1)})$…

We develop a method to compute the Ekedahl-Oort type of a curve C over a field k of characteristic p (which is the isomorphism type of the p-kernel group scheme J[p], where J is the Jacobian of C). Part of our method is general, in that we…

In this article, we present a method for computing rational points on hyperelliptic curves of genus~3 and isolated quadratic points on hyperelliptic curves of genus~2 and~3 whose Jacobians have rank~0. Our approach begins by computing the…

Suppose $X$ is a hyperelliptic curve of genus $g$ defined over an algebraically closed field $k$ of characteristic $p=2$. We prove that the de Rham cohomology of $X$ decomposes into pieces indexed by the branch points of the hyperelliptic…

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…

We describe an algorithm for computing certain quaternionic quotients of the Bruhat-Tits tree for GL2(Qp). As an application, we describe an algorithm to obtain (conjectural) equations for the canonical embedding of Shimura curves.

We prove a higher dimensional generalization of Gross and Zagier's theorem on the factorization of differences of singular moduli. Their result is proved by giving a counting formula for the number of isomorphisms between elliptic curves…

Shor's quantum algorithm for discrete logarithms applied to elliptic curve groups forms the basis of a "quantum attack" of elliptic curve cryptosystems. To implement this algorithm on a quantum computer requires the efficient implementation…

In this note is we exhibit an elementary method to construct explicitly curves over finite fields with many points. Despite its elementary character the method is very efficient and can be regarded as a partial substitute for the use of…

We determine all genus 2 curves, defined over $\mathbb C$, which have simultaneously degree 2 and 3 elliptic subcovers. The locus of such curves has three irreducible 1-dimensional genus zero components in $\mathcal M_2$. For each component…

We give bounds on the primes of geometric bad reduction for curves of genus three of primitive CM type in terms of the CM orders. In the case of genus one, there are no primes of geometric bad reduction because CM elliptic curves are CM…

We address the problems of constructing quantum convolutional codes (QCCs) and of encoding them. The first construction is a CSS-type construction which allows us to find QCCs of rate 2/4. The second construction yields a quantum…

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…

For a genus $2$ curve $C$ over $\mathbb{Q}$ whose Jacobian $A$ admits only trivial geometric endomorphisms, Serre's open image theorem for abelian surfaces asserts that there are only finitely many primes $\ell$ for which the Galois action…

We present a quasi-linear algorithm to compute isogenies between Jacobians of curves of genus 2 and 3 starting from the equation of the curve and a maximal isotropic subgroup of the l-torsion, for l an odd prime number, generalizing the…

In this work we propose an algorithm that numerically evaluates Kleinian hyperelliptic functions associated with a complex curve of genus 2. This algorithm is based upon constructing a sequence of curves with Richelot isogenous Jacobians…

We exploit three classical characterizations of smooth genus two curves to study their tropical and analytic counterparts. First, we provide a combinatorial rule to determine the dual graph of each algebraic curve and the metric structure…

We explicitly find an equation and a projective embedding of the Kummer surface associated to the Jacobian of a curve of genus 2 given by an equation of the form y^2 + h(x)y = f(x) over an arbitrary ground field as well as several maps that…

Given a prime q and a negative discriminant D, the CM method constructs an elliptic curve E/\Fq by obtaining a root of the Hilbert class polynomial H_D(X) modulo q. We consider an approach based on a decomposition of the ring class field…

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…