Related papers: Efficient arithmetic on elliptic curves in charact…
In this paper we address the problem of protecting elliptic curve scalar multiplication implementations against side-channel analysis by using the atomicity principle. First of all we reexamine classical assumptions made by scalar…
We present an algorithm that computes the Hasse-Witt matrix of given hyperelliptic curve over Q at all primes of good reduction up to a given bound N. It is simpler and faster than the previous algorithm developed by the authors.
We show how the modular symmetries that have been found to be consistent with most available scaling data from quantum Hall systems, derive from a rigid family of algebraic curves of the elliptic type. The complicated special functions…
Let $E$ be an elliptic curve over a number field $K$. Descent calculations on $E$ can be used to find upper bounds for the rank of the Mordell-Weil group, and to compute covering curves that assist in the search for generators of this…
We present a new approach to handling the case of Atkin primes in Schoof's algorithm for counting points on elliptic curves over finite fields. Our approach is based on the theory of polynomially cyclic algebras, which we recall as far as…
Let $E$ be an elliptic curve defined over a number field $K$, let $\alpha \in E(K)$ be a point of infinite order, and let $N^{-1}\alpha$ be the set of $N$-division points of $\alpha$ in $E(\bar{K})$. We prove strong effective and uniform…
As a subproduct of the Schoof-Elkies-Atkin algorithm to count points on elliptic curves defined over finite fields of characteristic p, there exists an algorithm that computes, for l an Elkies prime, l-torsion points in an extension of…
We present several new heuristic algorithms to compute class polynomials and modular polynomials modulo a prime $p$ by revisiting the idea of working with supersingular elliptic curves. The best known algorithms to this date are based on…
For a field $\mathbb{K}$ of characteristic $p\ge5$ containing $\mathbb{F}_{p}^{\operatorname{alg}}$ and the elliptic curve $E_{s,t}: y^{2} = x^{3} + sx + t$ defined over the function field $\mathbb{K}\left(s,t\right)$ of two variables $s$…
For each $t\in\mathbb{Q}\setminus\{-1,0,1\}$, define an elliptic curve over $\mathbb{Q}$ by \begin{align*} E_t:y^2=x(x+1)(x+t^2). \end{align*} Using a formula for the root number $W(E_t)$ as a function of $t$ and assuming some standard…
In this article we give explicit formulae for a lift of the relative Frobenius morphism between elliptic curves and show how one can compute this lift in the case of ordinary reduction in odd characteristic. Our theory can also be used in…
In this paper we study the problem of how to determine all elliptic curves defined over an arbitrary number field $K$ with good reduction outside a given finite set of primes $S$ of $K$ by solving $S$-unit equations. We give examples of…
We survey algorithms for computing isogenies between elliptic curves defined over a field of characteristic either 0 or a large prime. We introduce a new algorithm that computes an isogeny of degree $\ell$ ($\ell$ different from the…
We present algorithms to compute the topology of 2D and 3D hyperelliptic curves. The algorithms are based on the fact that 2D and 3D hyperelliptic curves can be seen as the image of a planar curve (the Weierstrass form of the curve), whose…
We describe the practical implementation of an average polynomial-time algorithm for counting points on superelliptic curves defined over $\mathbb Q$ that is substantially faster than previous approaches. Our algorithm takes as input a…
Cat qubits provide appealing building blocks for quantum computing. They exhibit a tunable noise bias yielding an exponential suppression of bit flips with the average photon number and a protection against the remaining phase errors can be…
We construct new families of elliptic curves over \(\FF_{p^2}\) with efficiently computable endomorphisms, which can be used to accelerate elliptic curve-based cryptosystems in the same way as Gallant-Lambert-Vanstone (GLV) and…
In the past years, research on Shor's algorithm for solving elliptic curves for discrete logarithm problems (Shor's ECDLP), the basis for cracking elliptic curve-based cryptosystems (ECC), has started to garner more significant interest. To…
We present a detailed analysis of how to implement the computation of modular symbols for a given elliptic curve by using numerical approximations. This method turns out to be more efficient than current implementation as the conductor of…
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.…