相关论文: Fast Elliptic Curve Arithmetic and Improved Weil P…

All the results in this paper are conditional on the Riemann Hypothesis for the L-functions of elliptic curves. Under this assumption, we show that the average analytic rank of all elliptic curves over Q is at most 2, thereby improving a…

By considering a one-parameter family of elliptic curves defined over $\mathbb{Q}$, we might ask ourselves if there is any bias in the distribution (or parity) of the root numbers at each specialization. From the work of Helfgott, we know…

In this paper, we give exact and asymptotic formulas for counting elliptic curves $ E_{A,B} \colon y^2 = x^3 + Ax + B $ with $ A, B \in \mathbb{Z} $, ordered by naive height. We study the family of all such curves and also several natural…

In this paper we introduce a generic model for multiplicative algorithms which is suitable for the MapReduce parallel programming paradigm. We implement three typical machine learning algorithms to demonstrate how similarity comparison,…

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 prove asymptotic formulas for cyclicity of reductions of elliptic curves over the rationals in a family of curves having specified torsion. These results agree with established conditional results and with average results taken over…

The problem of Phase Estimation (or Amplitude Estimation) admits a quadratic quantum speedup. Wang, Higgott and Brierley [2019, Phys. Rev. Lett. 122 140504] have shown that there is a continuous trade-off between quantum speedup and circuit…

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

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 perform logical and physical resource estimation for computing binary elliptic curve discrete logarithms using Shor's algorithm on fault-tolerant quantum computers. We adopt a windowed approach to design our circuit implementation of the…

We give an asymptotic formula for the number of elliptic curves over $\mathbb{Q}$ with bounded Faltings height. Silverman has shown that the Faltings height for elliptic curves over number fields can be expressed in terms of modular…

While algebrisation constitutes a powerful technique in the design and analysis of centralised algorithms, to date there have been hardly any applications of algebraic techniques in the context of distributed graph algorithms. This work is…

This paper presents a parallel random-search method for reducing additive complexity in fast matrix multiplication algorithms with ternary coefficients $\{-1,0,1\}$. The approach replaces expensive exact evaluation with fast heuristic…

We present an efficient, parallel, constrained optimization technique for approximating CAD curves with super-convergent rates. The optimization function is a disparity measure in terms of a piece-wise polynomial approximation and a curve…

We present an algorithm for the computation of period matrices and the Abel-Jacobi map of complex superelliptic curves given by an equation $y^m=f(x)$. It relies on rigorous numerical integration of differentials between Weierstrass points,…

For every number field $k$, we construct an affine algebraic surface $X$ over $k$ with a Zariski dense set of $k$-rational points, and a regular function $f$ on $X$ inducing an injective map $X(k)\to k$ on $k$-rational points. In fact,…

Let K be a field of characteristic different from 2 and C an elliptic curve over K given by a Weierstrass equation. To divide an element of the group C by 2, one must solve a certain quartic equation. We characterise the quartics arising…

We define and study the Weil pairing on the moduli of twisted curves. If $X$ is a twisted curve, then we can combinatorially describe a certain subgroup and a quotient group of $\text{Pic}(X)[2]$ that are Weil dual. Moreover, the pairing…

A new method for solving systems of linear algebraic equations of a special type arising in solving problems of image reconstruction has been proposed. This method, due to a certain symmetry of the matrix and the choice of the voxel…

This study proposes the "adaptive flip graph algorithm", which combines adaptive searches with the flip graph algorithm for finding fast and efficient methods for matrix multiplication. The adaptive flip graph algorithm addresses the…