Related papers: Efficiently computable endomorphisms for hyperelli…

We show that elliptic curves with complex multiplication (CM) naturally emerge in the spectral geometry of Hermitian one-matrix models in the two-cut phase. Focusing on a symmetric quartic potential, we derive the corresponding genus-one…

We consider the question of which quadratic fields have elliptic curves with everywhere good reduction. By revisiting work of Setzer, we expand on congruence conditions that determine the real and imaginary quadratic fields with elliptic…

We prove that there are only finitely many modular curves of $D$-elliptic sheaves over $\mathbb{F}_q(T)$ which are hyperelliptic. In odd characteristic we give a complete classification of such curves.

In this paper, we present a review of three widely-used practical square root algorithms. We then describe a unifying framework where each of these well-known algorithms can be seen as a special case of it. The framework with singular…

Let $\mathcal{C}$ be a smooth, projective, genus $g\geq 2$ curve, defined over $\mathbb{C}$. Then $\mathcal{C}$ has \emph{many automorphisms} if its corresponding moduli point $p \in \mathcal{M}_g$ has a neighborhood $U$ in the complex…

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…

Let $E:y^2=(x-e_1)(x-e_2)(x-e_3)$ be a nonconstant elliptic curve over $\mathbb{Q}(t)$, where $e_j\in \mathbb{Z}[t]$. We describe a method for finding a specialization $t\mapsto t_0\in\mathbb{Q}$ such that the specialization homomorphism is…

We introduce a class of iterated integrals, defined through a set of linearly independent integration kernels on elliptic curves. As a direct generalisation of multiple polylogarithms, we construct our set of integration kernels ensuring…

We outline a general algorithm for computing an explicit model over a number field of any curve of genus 2 whose (unpolarized) Jacobian is isomorphic to the product of two elliptic curves with CM by the same order in an imaginary quadratic…

A general scheme for determining and studying integrable deformations of algebraic curves is presented. The method is illustrated with the analysis of the hyperelliptic case. An associated multi-Hamiltonian hierarchy of systems of…

A new approach has been recently developed to study the arithmetic of hyperelliptic curves $y^2=f(x)$ over local fields of odd residue characteristic via combinatorial data associated to the roots of $f$. Since its introduction, numerous…

We consider the problem of efficient computation in the Jacobian of a hyperelliptic curve of genus 3 defined over a field whose characteristic is not 2. For curves with a rational Weierstrass point, fast explicit formulas are well known and…

For a given elliptic curve $E_0$ defined over a number field $k$, we construct two families of elliptic curves whose mod 3 representations are isomorphic to that of $E_0$. The isomorphisms in the first family are symplectic, and those in…

We construct explicit families of hyperelliptic curves over $\QQ$ whose Jacobians admit complex multiplication (CM). Each curve in these families is defined by \[ v^2 = (u+2)\,\varphi_d(u), \quad d = 2^e \text{ or } d=p \geq 3 \text{…

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…

Several problems which could be thought of as belonging to recreational mathematics are described. They are all such that solutions to the problem depend on finding rational points on elliptic curves. Many of the problems considered lead to…

In 2015, Abatzoglou, Silverberg, Sutherland, and Wong presented a framework for primality proving algorithms for special sequences of integers using an elliptic curve with complex multiplication. They applied their framework to obtain…

We introduce the notion of isolated genus two curves. As there is no known efficient algorithm to explicitly construct isogenies between two genus two curves with large conductor gap, the discrete log problem (DLP) cannot be efficiently…

We propose a randomized algorithm to compute isomorphisms between finite fields using elliptic curves. To compute an isomorphism between two fields of cardinality $q^n$, our algorithm takes $$n^{1+o(1)} \log^{1+o(1)}q + \max_{\ell}…

In this paper, we propose an efficient continuation method for locating multiple power flow solutions. We adopt the holomorphic embedding technique to represent solution curves as holomorphic functions in the complex plane. The…