Related papers: Cover attacks for elliptic curves with prime order
We show that there exists a surjection from the set of effective divisors of degree $g$ on a tropical curve of genus $g$ to its Jacobian by using a tropical version of the Riemann-Roch theorem. We then show that the restriction of the…
It has recently been shown that cryptographic trilinear maps are sufficient for achieving indistinguishability obfuscation. In this paper we develop a method for constructing such maps on the Weil descent (restriction) of abelian varieties…
The Weil pairing on elliptic curves has deep links with discrete logarithm problems. In practice, to better suit the functionalities of cryptosystems, one often needs to modify the original Weil pairing via what is called a distortion map.…
We study $N$-congruences between quadratic twists of elliptic curves. If $N$ has exactly two distinct prime factors we show that these are parametrised by double covers of certain modular curves. In many, but not all cases, the modular…
We show that, for each $n>0$, there is a family of elliptic surfaces which are covered by the square of a curve of genus $2n+1$, and whose Hodge structures have an action by ${\mathbb Q}(\sqrt{-n})$. By considering the case $n=3$, we show…
Although it is not known which groups can appear as torsion groups of elliptic curves over cubic number fields, it is known which groups can appear for infinitely many non-isomorphic curves. We denote the set of these groups as $S$. In this…
We consider the numerical solution of partial differential equations with coefficients that are strongly heterogeneous in space. We provide an overview of higher-order localized orthogonal decomposition (LOD) methods for the elliptic…
In 2004, Muzereau et al. showed how to use a reduction algorithm of the discrete logarithm problem to Diffie-Hellman problem in order to estimate lower bound on Diffie-Hellman problem on elliptic curves. They presented their estimates for…
The first step in elliptic curve scalar multiplication algorithms based on scalar decompositions using efficient endomorphisms-including Gallant-Lambert-Vanstone (GLV) and Galbraith-Lin-Scott (GLS) multiplication, as well as…
We investigate the elliptic analogs of multi-indexed polylogarithms that appear in the theory of the fundamental group of the projective line minus three points as sections of a universal nilpotent bundle with regular singular connection.…
We formulate a problem called \emph{Generalized Root Extraction} in finite Abelian groups that have more than one generator. We then study this problem for the specific case of the torsion subgroups of elliptic curves. We give a necessary…
In 1972, Serre showed that the adelic Galois representation associated to a non-CM elliptic curve over a number field has open image in GL_2(\hat{Z}). In Greicius' thesis, he develops necessary and sufficient criteria for determining when…
We study the reduction properties of low genus curves whose Jacobian has complex multiplication. In the elliptic curve case, we classify the possible Kodaira types of reduction that can occur. Moreover, we investigate the possible Namikawa…
In this article, we construct algebraic equations for a curve C and a map f to an elliptic curve E, with pre-specified branching data. We do this by determining certain relations that the periods of C and E must satisfy and use these…
In this brief note we connect the discrete logarithm problem over prime fields in the safe prime case to the logarithmic derivative.
We show that for all odd primes $p$, there exist ordinary elliptic curves over $\bar{\mathbb{F}}_p(x)$ with arbitrarily high rank and constant $j$-invariant. This shows in particular that there are elliptic curves with arbitrarily high rank…
Let $K$ be an imaginary quadratic field, and let $\mathcal{O}_{K,f}$ be an order in $K$ of conductor $f\geq 1$. Let $E$ be an elliptic curve with CM by $\mathcal{O}_{K,f}$, such that $E$ is defined by a model over $\mathbb{Q}(j_{K,f})$,…
Solving the discrete logarithm problem in a finite prime field is an extremely important computing problem in modern cryptography. The hardness of solving the discrete logarithm problem in a finite prime field is the security foundation of…
Let $E:y^2=x^3+Ax^2+Bx+C$ be a nonconstant elliptic curve over $\mathbb{Q}(t)$ with at least one nontrivial $\mathbb{Q}(t)$-rational $2$-torsion point. We describe a method for finding $t_0\in\mathbb Q$ for which the corresponding…
We give algorithms for computing with divisors on projective curves over finite fields, and with their Jacobians, using the algorithmic representation of projective curves developed by Khuri-Makdisi. We show that many desirable operations…