Related papers: Accelerating the CM method

Let $E/\mathbb{Q}$ be an elliptic curve that has complex multiplication (CM) by an imaginary quadratic field $K$. For a prime $p$, there exists $\theta_p \in [0, \pi]$ such that $p+1-\#E(\mathbb{F}_p) = 2\sqrt{p} \cos \theta_p$. Let $x>0$…

We determine the quantum multiplication with divisor classes on the Hilbert scheme of points on an elliptic surface $S \to \Sigma$ for all curve classes which are contracted by the induced fibration $S^{[n]} \to \Sigma^{[n]}$. The formula…

Let $T_{\mathrm{CM}}(d)$ denote the maximum size of a torsion subgroup of a CM elliptic curve over a degree $d$ number field. We initiate a systematic study of the asymptotic behavior of $T_{\mathrm{CM}}(d)$ as an "arithmetic function".…

We present a specialized point-counting algorithm for a class of elliptic curves over F\_{p^2} that includes reductions of quadratic Q-curves modulo inert primes and, more generally, any elliptic curve over F\_{p^2} with a low-degree…

We show that elliptic curves with complex multiplication (CM) naturally emerge in the spectral geometry of Hermitian one-matrix models in the two-cut phase. Focusing on a symmetric quartic potential, we derive the corresponding genus-one…

We give a new algorithm for constructing Picard curves over a finite field with a given endomorphism ring. This has important applications in cryptography since curves of genus 3 allow for smaller key sizes than elliptic curves. For a…

In previous research, quantum resources were concretely estimated for solving Elliptic Curve Discrete Logarithm Problem(ECDLP). In [1], the quantum algorithm was optimized for the binary elliptic curves and the main optimization target was…

Let $E$ be a CM elliptic curve over $\Bbb{Q}$. We refine the work of Cojocaru on the asymptotic formulae for the number of primes $p\le x$ for which the reduction modulo $p$ of $E$ is of square-free order. Also, we derive an unconditional…

Elliptic curve multiplications can be improved by replacing the standard ladder algorithm's base 2 representation of the scalar multiplicand, with mixed-base representations with power-of-2 bases, processing the n bits of the current digit…

Let E be an elliptic curve having Complex Multiplication by the full ring O_K of integers of K=Q(\sqrt{-D}), let H=K(j(E)) be the Hilbert class field of K. Then the Mordell-Weil group E(H) is an O_K-module, and its structure denpends on its…

Let $E/\mathbb{Q}$ be a fixed elliptic curve. For each prime $p$ of good reduction, write $E(\mathbb{F}_p) \cong \mathbb{Z}/d_p \mathbb{Z} \oplus \mathbb{Z}/e_p \mathbb{Z}$, where $d_p \mid e_p$. Kowalski proposed investigating the average…

We show in some detail how to implement Shor's efficient quantum algorithm for discrete logarithms for the particular case of elliptic curve groups. It turns out that for this problem a smaller quantum computer can solve problems further…

In this paper, we present several methods for construction of elliptic curves with large torsion group and positive rank over number fields of small degree. We also discuss potential applications of such curves in the elliptic curve…

The paper suggests a preconditioning type method for fast solving of elliptic equations with oscillating quasiperiodic coefficients $A_\epsilon$ specified by the small parameter $\epsilon>0$. We use an iteration method generated by an…

Given a prime power q, for every pair of positive integers m and n with m dividing the GCD of n and q-1, we construct a modular curve over F_q that parametrizes elliptic curves over F_q along with F_q-defined points P and Q of order m and…

The Multiquadric Radial Basis Function (MQ) Method is a meshless collocation method with global basis functions. It is known to have exponentional convergence for interpolation problems. We descretize nonlinear elliptic PDEs by the MQ…

Let $\mathcal{E}$ be a CM elliptic curve defined over a number field $K$, with Weiestrass form $y^3=x^3+bx$ or $y^2=x^3+c$. For every positive integer $m$, we denote by ${\mathcal{E}}[m]$ the $m$-torsion subgroup of ${\mathcal{E}}$ and by…

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…

We prove several results on torsion points and Galois representations for complex multiplication (CM) elliptic curves over a number field containing the CM field. One result computes the degree in which such an elliptic curve has a rational…

Kinetic transport equations are notoriously difficult to simulate because of their complex multiscale behaviors and the need to numerically resolve a high dimensional probability density function. Past literature has focused on building…