Related papers: Efficient arithmetic on elliptic curves in charact…
This paper introduces an optimal representation for a right-to-left parallel elliptic curve scalar point multiplication. The right-to-left approach is easier to parallelize than the conventional left-to-right approach. However, unlike the…
A fast algorithm for counting intersections of two normal curves on a triangulated surface is proposed. It yields a convenient way for treating mapping class groups of punctured surfaces by presenting mapping classes by matrices, and the…
Lenstra's integer factorization algorithm is asymptotically one of the fastest known algorithms, and is ideally suited for parallel computation. We suggest a way in which the algorithm can be speeded up by the addition of a second phase.…
This is the third in a series of papers in which we study the n-Selmer group of an elliptic curve, with the aim of representing its elements as curves of degree n in P^{n-1}. The methods we describe are practical in the case n=3 for…
For a given elliptic curve, its associated $L$-function evaluated at $1$ is closely related to its real period. In this article, we generalize this principle to a rational curve. We count the rational points over all finite fields and use…
We study genus one curves that arise as 2-, 3- and 4-coverings of elliptic curves. We describe efficient algorithms for testing local solubility and modify the classical formulae for the covering maps so that they work in all…
In this paper, we study the theories of analytic and arithmetic local constants of elliptic curves, with the work of Rohrlich, for the former, and the work of Mazur and Rubin, for the latter, as a basis. With the Parity Conjecture as…
Under the Riemann Hypothesis for Dirichlet L-functions, we improve on the error term in a smoothed version of an estimate for the density of elliptic curves with square-free $\Delta=D/16$, where D is the discriminant, by T.D. Browning and…
A simple and efficient algorithm to numerically compute the genus of surfaces of three-dimensional objects using the Euler characteristic formula is presented. The algorithm applies to objects obtained by thresholding a scalar field in a…
Solving the Elliptic Curve Discrete Logarithm Problem (ECDLP) is critical for evaluating the quantum security of widely deployed elliptic-curve cryptosystems. Consequently, minimizing the number of logical qubits required to execute this…
We consider the problem of bounding the dimension of the linear system of curves in ${\bf P}^2$ of degree $d$ with prescribed multiplicities $m_1,...,m_n$ at $n$ general points (\cite{Hir1},\cite{Hir2}). We propose a new method, based on…
In this paper, a new iterative two-level algorithm is presented for solving the finite element discretization for nonsymmetric or indefinite elliptic problems. The iterative two-level algorithm uses the same coarse space as the traditional…
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…
For a given elliptic curve $E$ over a finite local ring, we denote by $E^{\infty}$ its subgroup at infinity. Every point $P \in E^{\infty}$ can be described solely in terms of its $x$-coordinate $P_x$, which can be therefore used to…
We analyze the point decomposition problem (PDP) in binary elliptic curves. It is known that PDP in an elliptic curve group can be reduced to solving a particular system of multivariate non-linear system of equations derived from the so…
We consider multiply periodic functions, sometimes called Abelian functions, defined with respect to the period matrices associated with classes of algebraic curves. We realise them as generalisations of the Weierstras P-function using two…
Censor-Hillel et al. [PODC'15] recently showed how to efficiently implement centralized algebraic algorithms for matrix multiplication in the congested clique model, a model of distributed computing that has received increasing attention in…
In this paper, we intend to study the geometric meaning of the discrete logarithm problem defined over an Elliptic Curve. The key idea is to reduce the Elliptic Curve Discrete Logarithm Problem (EC-DLP) into a system of equations. These…
We present a deterministic algorithm that computes the zeta function of a nonsupersingular elliptic curve E over a finite field with p^n elements in time quasi-quadratic in n. An older algorithm having the same time complexity uses the…
We derive simplified normal forms for an area-preserving map in a neighbourhood of a degenerate resonant elliptic fixed point. Such fixed points appear in generic two-parameter families of area-preserving maps. We also derive a simplified…