相关论文: Fast algorithms for computing isogenies between el…

Detecting elliptical objects from an image is a central task in robot navigation and industrial diagnosis where the detection time is always a critical issue. Existing methods are hardly applicable to these real-time scenarios of limited…

Let l be a prime number and let E and E' be l-isogenous elliptic curves defined over Q. In this paper we determine the proportion of primes p for which E(F_p) is isomorphic to E'(F_p). Our techniques are based on those developed in…

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.…

Consider the problem of efficiently evaluating isogenies $\phi: E \to E/H$ of elliptic curves over a finite field $\mathbb{F}_q$, where the kernel $H = \langle G\rangle$ is a cyclic group of odd (prime) order: given $E$, $G$, and a point…

We determine the possible degrees of cyclic isogenies defined over quadratic fields for non-CM elliptic curves with rational $j$-invariant.

Fix an elliptic curve $E_0$ without CM and a non-isotrivial elliptic scheme over a smooth irreducible curve, both defined over the algebraic numbers. Consider the union of all images of a fixed finite-rank subgroup (of arbitrary rank) of…

Let $\cO$ be a maximal order in a definite quaternion algebra over $\mathbb{Q}$ of prime discriminant $p$, and $\ell$ a small prime. We describe a probabilistic algorithm, which for a given left $O$-ideal, computes a representative in its…

Let E_G be a family of hyperelliptic curves over F2^(alg cl) with general Weierstrass equation given over a very small field F. We describe in this paper an algorithm to compute the zeta function of E_g for g in a degree n extension field…

Following work of Mazur-Tate and Satoh, we extend the definition of division polynomials to arbitrary isogenies of elliptic curves, including those whose kernels do not sum to the identity. In analogy to the classical case of division…

Let $\ell$ be a prime number and let $E$ and $E'$ be $\ell$-isogenous elliptic curves defined over a finite field $k$ of characteristic $p \ne \ell$. Suppose the groups $E(k)$ and $E'(k)$ are isomorphic, but $E(K) \not \simeq E'(K)$, where…

Computing endomorphism rings of supersingular elliptic curves is an important problem in computational number theory, and it is also closely connected to the security of some of the recently proposed isogeny-based cryptosystems. In this…

We present new addition formulae for the Weierstrass functions associated with a general elliptic curve. We prove the structure of the formulae in n-variables and give the explicit addition formulae for the 2- and 3-variable cases. These…

We count by height the number of elliptic curves over the rationals, both up to isomorphism over the rationals and over an algebraic closure thereof, that admit a cyclic isogeny of degree $7$.

Let E be an elliptic curve without complex multiplication (CM) over a number field K, and let G_E(ell) be the image of the Galois representation induced by the action of the absolute Galois group of K on the ell-torsion subgroup of E. We…

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…

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…

$W^{1, p}$ estimate for the solutions of elliptic equations whose coefficient matrix can have large jump along the boundary of subdomains is obtained. The principal coefficients are supposed to be in the John-Nirenberg space with small BMO…

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…

In this paper we present, using the arithmetic of elliptic curves over finite fields, an algorithm for the efficient generation of a sequence of uniform pseudorandom vectors in high dimensions, that simulates a sample of a sequence of…

In this work we propose an algorithm that numerically evaluates Kleinian hyperelliptic functions associated with a complex curve of genus 2. This algorithm is based upon constructing a sequence of curves with Richelot isogenous Jacobians…