Related papers: The geometry of efficient arithmetic on elliptic c…
Elliptic curves over finite fields with predefined conditions in the order are practically constructed using the theory of complex multiplication. The stage with longest calculations in this method reconstructs some polynomial with integer…
We present normal forms for elliptic curves over a field of characteristic $2$ analogous to Edwards normal form, and determine bases of addition laws, which provide strikingly simple expressions for the group law. We deduce efficient…
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…
The study of alternative models for elliptic curves has found recent interest from cryptographic applications, once it was recognized that such models provide more efficiently computable algorithms for the group law than the standard…
We provide a natural definition of an elliptic arrangement, extending the classical framework to an elliptic curve E with complex multiplication. We analyse the intersections of elements of the arrangement and their connected components as…
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 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 revisit the group structure on elliptic curves and give a simple and elementary proof of the associativity of the addition. We do this by providing an explicit formula for the sum of three points, only using the explicit definition of…
We derive a new bound for some bilinear sums over points of an elliptic curve over a finite field. We use this bound to improve a series of previous results on various exponential sums and some arithmetic problems involving points on…
A formalism is given to count integer and rational solutions to polynomial equations with rational coefficients. These polynomials $P(x)$ are parameterized by three integers, labeling an elliptic curve. The counting of the rational…
There are many numerical methods for solving partial different equations (PDEs) on manifolds such as classical implicit, finite difference, finite element, and isogeometric analysis methods which aim at improving the interoperability…
We give new bounds for the number of integral points on elliptic curves. The method may be said to interpolate between approaches via diophantine techniques ([BP], [HBR]) and methods based on quasiorthogonality in the Mordell-Weil lattice…
We consider the problem of checking whether an elliptic curve defined over a given number field has complex multiplication. We study two polynomial time algorithms for this problem, one randomized and the other deterministic. The randomized…
We represent vector bundles over a regular algebraic curve as pairs of lattices over the maximal orders of its function field and we give polynomial time algorithms for several tasks: computing determinants of vector bundles, kernels and…
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…
We develop the basic formulae of hyperspherical trigonometry in multidimensional Euclidean space, using multidimensional vector products, and their conversion to identities for elliptic functions. We show that the basic addition formulae…
We look for elliptic curves featuring rational points whose coordinates form two arithmetic progressions, one for each coordinate. A constructive method for creating such curves is shown, for lengths up to 5.
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.
We give the complete list of possible torsion subgroups of elliptic curves with complex multiplication over number fields of degree 1-13. Additionally we describe the algorithm used to compute these torsion subgroups and its implementation.
Division polynomials associated to an elliptic curve $E/K$ are polynomials $\phi_n, \psi_n^2$ that arise from the sequence of points $\{nP\}_{n \in \mathbb{N}}$ on this curve. If one wishes to study $\mathbb{Z}$--linear combination of…