Related papers: Computation of genus 2 Kleinian hyperelliptic func…

We find an explicit expression for the Richelot isogeny of Kummer surfaces of genus 2 curves in terms of Kleinian hyperelliptic functions of weight 2. We use this expression to relate Kleinian hyperelliptic functions associated to Richelot…

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 algebraic geometry, superspecial curves are important research objects. While the number of superspecial genus-3 curves in characteristic $p$ is known, the number of hyperelliptic ones among them has not been determined even for small…

A Richelot isogeny between Jacobian varieties is an isogeny whose kernel is included in the $2$-torsion subgroup of the domain. A Richelot isogeny whose codomain is the product of two or more principally polarized abelian varieties is…

In this paper we study genus 2 curves whose Jacobians admit a polarized (4,4)-isogeny to a product of elliptic curves. We consider base fields of characteristic different from 2 and 3, which we do not assume to be algebraically closed. We…

We introduce a new collection of special functions associated to a complex curve of genus 2 similar to Kleinian hyperelliptic $\sigma$-function. These functions are related to weight 2 $\theta$-functions in the same fashion as…

We present an algorithm solving the following problem: given two genus 2 curves over a field k with isogenous Jacobians, compute such an isogeny explicitly. This isogeny can be either an l-isogeny or, in the real multiplication case, an…

We show how to efficiently compute functions on jacobian varieties and their quotients. We deduce a quasi-optimal algorithm to compute $(l,l)$ isogenies between jacobians of genus two curves.

We give an algorithm to compute $(\ell,\ell,\ell)$-isogenies from the Jacobians of genus three hyperelliptic curves to the Jacobians of non-hyperelliptic curves. An important application is to reduce the discrete logarithm problem in the…

We propose an algorithm that calculates isogenies between elliptic curves defined over an extension $K$ of $\mathbb{Q}_2$. It consists in efficiently solving with a logarithmic loss of $2$-adic precision the first order differential…

Let $p$ be an odd prime number and be an integer coprime to $p$. We survey an algorithm for computing explicit rational representations of $(\ell,...,\ell)$-isogenies between Jacobians of hyperelliptic curves of arbitrary genus over an…

Castryck, Decru, and Smith used superspecial genus-2 curves and their Richelot isogeny graph for basing genus-2 isogeny cryptography, and recently, Costello and Smith devised an improved isogeny path-finding algorithm in the genus-2…

In this paper, we study the Cassels-Tate pairing on Jacobians of genus two curves admitting a special type of isogenies called Richelot isogenies. Let $\phi: J \rightarrow \widehat{J}$ be a Richelot isogeny between two Jacobians of genus…

Let p be an odd prime number and g $\ge$ 2 be an integer. We present an algorithm for computing explicit rational representations of isogenies between Jacobians of hyperelliptic curves of genus g over an extension K of the field of p-adic…

We construct families of hyperelliptic curves over Q of arbitrary genus g with (at least) g integral elements in K_2. We also verify the Beilinson conjectures about K_2 numerically for several curves with g=2, 3, 4 and 5. The paper is…

We advance previous studies on decomposed Richelot isogenies (Katsura--Takashima (ANTS 2020) and Katsura (ArXiv 2021)) which are useful for analysing superspecial Richelot isogeny graphs in cryptography. We first give a characterization of…

Schoof's classic algorithm allows point-counting for elliptic curves over finite fields in polynomial time. This algorithm was subsequently improved by Atkin, using factorizations of modular polynomials, and by Elkies, using a theory of…

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…

Genus 5 curves can be hyperelliptic, trigonal, or non-hyperelliptic non-trigonal, whose model is a complete intersection of three quadrics in $\mathbb{P}^4$. We present and explain algorithms we used to determine, up to isomorphism over…

Genus 2 curves have been an object of much mathematical interest since eighteenth century and continued interest to date. They have become an important tool in many algorithms in cryptographic applications, such as factoring large numbers,…