Related papers: Cover attacks for elliptic curves with prime order

We call a simple abelian variety over $\mathbb{F}_p$ super-isolated if its ($\mathbb{F}_p$-rational) isogeny class contains no other varieties. The motivation for considering these varieties comes from concerns about isogeny based attacks…

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 give a generalization of the method of "Elliptic Curve Chabauty" to higher genus curves and their Jacobians. This method can sometimes be used in conjunction with covering techniques and a modified version of the Mordell-Weil sieve to…

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…

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 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…

A genus 2 curve $C$ has an elliptic subcover if there exists a degree $n$ maximal covering $\psi: C \to E$ to an elliptic curve $E$. Degree $n$ elliptic subcovers occur in pairs $(E, E')$. The Jacobian $J_C$ of $C$ is isogenous of degree…

We analyse the complexity of solving the discrete logarithm problem and of testing the principality of ideals in a certain class of number fields. We achieve the subexponential complexity in $O(L(1/3,O(1)))$ when both the discriminant and…

Let $E$ be an elliptic curve defined over $\mathbb{Q}$, and let $\mathbb{Q}^{ab}$ be the maximal abelian extension of $\mathbb{Q}$. In this article we classify the groups that can arise as $E(\mathbb{Q}^{ab})_{\text{tors}}$ up to…

This paper presents a generalization of a method allowing the transformation of the Elliptic Curve Discrete Logarithm Problem (ECDLP) over prime fields to the Quadratic Unconstrained Binary Optimization (QUBO) problem. The original method…

We give a general framework for uniform, constant-time one-and two-dimensional scalar multiplication algorithms for elliptic curves and Jacobians of genus 2 curves that operate by projecting to the x-line or Kummer surface, where we can…

In this article we present a characterization of elliptic curves defined over a finite field Fq which possess a rational subgroup of order three. There are two posible cases depending on the rationality of the points in these groups. We…

Let $q = 2^n$, and let $E / \mathbb{F}_{q^{\ell}}$ be a generalized Galbraith--Lin--Scott (GLS) binary curve, with $\ell \ge 2$ and $(\ell, n) = 1$.We show that the GLS endomorphism on $E / \mathbb{F}_{q^{\ell}}$ induces an efficient…

We determine all groups which occur as torsion subgroups of $\mathbb Q$-curves defined over number fields of degrees $3$, $5$ and $7$. In particular, we prove that every torsion subgroup of a $\mathbb Q$-curve defined over a number field of…

This paper gives a conjectural characterization of those elliptic curves over the field of complex numbers which "should" be covered by standard modular curves. The elliptic curves in question all have algebraic j-invariant, so they can be…

Given a genus two curve $X: y^2 = x^5 + a x^3 + b x^2 + c x + d$, we give an explicit parametrization of all other such curves $Y$ with a specified symplectic isomorphism on three-torsion of Jacobians $\mbox{Jac}(X)[3] \cong…

We present an efficient endomorphism for the Jacobian of a curve $C$ of genus 2 (hyperelliptic) for divisors having a Non disjoint support. This extends the work of Costello and Lauter in [12] who calculated explicit formulae for divisor…

A survey on algorithms for computing discrete logarithms in Jacobians of curves over finite fields.

For an elliptic curve $E$ defined over the field $\mathbb{C}$ of complex numbers, we classify all translates of elliptic curves in $E^3$ such that the $x$-coordinates satisfy a linear equation. This classification enables us to establish a…

In this paper, we establish the modularity of every elliptic curve $E/F$, where $F$ runs over infinitely many imaginary quadratic fields, including $\mathbb{Q}(\sqrt{-d})$ for $d=1,2,3,5$. More precisely, let $F$ be imaginary quadratic and…