Related papers: Fast Elliptic Curve Arithmetic and Improved Weil P…
We give a classification of all possible $2$-adic images of Galois representations associated to elliptic curves over $\mathbb{Q}$. To this end, we compute the 'arithmetically maximal' tower of 2-power level modular curves, develop…
We establish a version of the Landen's transformation for Weierstrass functions and invariants that is applicable to general lattices in complex plane. Using it we present an effective method for computing Weierstrass functions, their…
Elliptic curves are planar curves which can be used to define an abelian group. The efficient computation of discrete logarithms over this group is a longstanding problem relevant to cryptography. It may be possible to efficiently compute…
We study generalisations to totally real fields of methods originating with Wiles and Taylor-Wiles. In view of the results of Skinner-Wiles on elliptic curves with ordinary reduction, we focus here on the case of supersingular reduction.…
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…
Elliptic curves have a well-known and explicit theory for the construction and application of endomorphisms, which can be applied to improve performance in scalar multiplication. Recent work has extended these techniques to hyperelliptic…
For an elliptic curve $E$ over a finite field $\F_q$, where $q$ is a prime power, we propose new algorithms for testing the supersingularity of $E$. Our algorithms are based on the Polynomial Identity Testing (PIT) problem for the $p$-th…
The All-Pairs Shortest Paths (APSP) is a foundational problem in theoretical computer science. Approximating APSP in undirected unweighted graphs has been studied for many years, beginning with the work of Dor, Halperin and Zwick…
Let $\mathcal{E}/\mathbb{F}_q$ be an elliptic curve, and $P$ a point in $\mathcal{E}(\mathbb{F}_q)$ of prime order $\ell$. V\'elu's formulae let us compute a quotient curve $\mathcal{E}' = \mathcal{E}/\langle{P}\rangle$ and rational maps…
The Frank Wolfe algorithm (FW) is a popular projection-free alternative for solving large-scale constrained optimization problems. However, the FW algorithm suffers from a sublinear convergence rate when minimizing a smooth convex function…
The Augmented Lagragian Method (ALM) and Alternating Direction Method of Multiplier (ADMM) have been powerful optimization methods for general convex programming subject to linear constraint. We consider the convex problem whose objective…
Let q be a prime power and E a non-isotrivial elliptic curve over Fq(T) given by a Weierstrass model. We survey the construction, with an explicit point of view, of the modular parametrization of E by the associated Drinfeld modular curve.…
We present two fast algorithms for matrix-vector multiplication $y=Ax$, where $A$ is a Hankel matrix. The current asymptotically fastest method is based on the Fast Fourier Transform (FFT), however in multiprecision arithmetics with very…
We provide a framework for using elliptic curves with complex multiplication to determine the primality or compositeness of integers that lie in special sequences, in deterministic quasi-quadratic time. We use this to find large primes,…
By combining tools from different areas of mathematics, we obtain 3D visualizations of elliptic curves over different fields that faithfully capture the underlying algebra and geometry.
An isogeny class of elliptic curves over a finite field is determined by a quadratic Weil polynomial. Gekeler has given a product formula, in terms of congruence considerations involving that polynomial, for the size of such an isogeny…
This paper describes a 2-D graphics algorithm that uses shifts and adds to precisely plot a series of points on an ellipse of any shape and orientation. The algorithm can also plot an elliptic arc that starts and ends at arbitrary angles.…
Let $E:y^2=x^3+ax+b$ be an elliptic curve defined over $\mathbb{Q}$. We compute certain twists of the classical modular curves $X(8)$. Searching for rational points on these twists enables us to find non-trivial pairs of $8$-congruent…
Parallel transport is a fundamental tool to perform statistics on Rie-mannian manifolds. Since closed formulae don't exist in general, practitioners often have to resort to numerical schemes. Ladder methods are a popular class of algorithms…
In this letter, an accelerated quadratic programming (QP) algorithm is proposed based on the proximal gradient method. The algorithm can achieve convergence rate $O(1/p^{\alpha})$, where $p$ is the iteration number and $\alpha$ is the given…