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

An algorithm is given to compute a normal form for hyperelliptic curves. The elliptic case has been treated in a previous paper. In this paper the hyperelliptic case is treated.

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…

Given an elliptic curve E over a field of positive characteristic p, we consider how to efficiently determine whether E is ordinary or supersingular. We analyze the complexity of several existing algorithms and then present a new approach…

We determine the probability that a random Weierstrass equation with coefficients in the $p$-adic integers defines an elliptic curve with a non-trivial $3$-torsion point, or with a degree $3$ isogeny, defined over the field of $p$-adic…

Let $p$ be an odd prime number. We propose an algorithm for computing rational representations of isogenies between Jacobians of hyperelliptic curves via-adic differential equations with a sharp analysis of the loss of precision.…

Let $K$ be a quadratic field which is not an imaginary quadratic field of class number one. We describe an algorithm to compute the primes $p$ for which there exists an elliptic curve over $K$ admitting a $K$-rational $p$-isogeny. This…

Let $\mathcal{E}$ be an elliptic curve over a field $\mathbf{K}$ and $\ell$ a prime. There exists an elliptic curve $\mathcal{E}^*$ related to $\mathcal{E}$ by an isogeny of degree $\ell$ only if $\Phi_\ell^t(X, j(\mathcal{E})) = 0$, where…

In this note we give an algorithm to explicitly construct the modular parametrization of an elliptic curve over the rationals given the Weierstrass function $\wp (z)$.

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…

We study the modular curves defined by Weber functions, and associated modular polynomials, action of $\mathrm{SL}_2(\mathbb{Z})$, and parametrizations of elliptic curves with a view to the study of the isogeny graphs that they determine,…

The Deligne-Ogus-Shioda theorem guarantees the existence of isomorphisms between products of supersingular elliptic curves over finite fields. In this paper, we present methods for explicitly computing these isomorphisms in polynomial time,…

We present a quasi-linear algorithm to compute isogenies between Jacobians of curves of genus 2 and 3 starting from the equation of the curve and a maximal isotropic subgroup of the l-torsion, for l an odd prime number, generalizing the…

Assuming the Generalized Riemann Hypothesis, we design a deterministic algorithm that, given a prime p and positive integer m=o(sqrt(p)/(log p)^4), outputs an elliptic curve E over the finite field F_p for which the cardinality of E(F_p) is…

We give an efficient algorithm to compute equations of twists of hyperelliptic curves of arbitrary genus over any separable field (of characteristic different from 2), and we explicitly describe some interesting examples.

We design a probabilistic algorithm for computing endomorphism rings of ordinary elliptic curves defined over finite fields that we prove has a subexponential runtime in the size of the base field, assuming solely the generalized Riemann…

We put together some known theoretical results and the fact that certain computations can be done efficiently in SAGE to come up with a fast algorithm for calculating congruence primes linking a newform with integer coefficients (i.e. a…

We consider character sums determined by isogenies of elliptic curves over finite fields. We prove a congruence condition for character sums attached to arbitrary cyclic isogenies, and produce explicit formulas for isogenies of small…

We introduce a new iterative method for computing solutions of elliptic equations with random rapidly oscillating coefficients. Similarly to a multigrid method, each step of the iteration involves different computations meant to address…

We count by height the number of elliptic curves over the rationals that possess an isogeny of degree three.

Isogenies occur throughout the theory of elliptic curves. Recently, the cryptographic protocols based on isogenies are considered as candidates of quantum-resistant cryptographic protocols. Given two elliptic curves $E_1, E_2$ defined over…