Related papers: Improved Weil and Tate pairings for elliptic and h…
We call a pair of distinct prime powers $(q_1,q_2) = (p_1^{a_1},p_2^{a_2})$ a Hasse pair if $|\sqrt{q_1}-\sqrt{q_2}| \leq 1$. For such pairs, we study the relation between the set $\mathcal{E}_1$ of isomorphism classes of elliptic curves…
We describe an algorithm that determines a set of unramified covers of a given hyperelliptic curve, with the property that any rational point will lift to one of the covers. In particular, if the algorithm returns an empty set, then the…
We present an enhanced algorithm for exploring mirror symmetry for elliptic curves through the correspondence of algebraic and tropical geometry, focusing on Gromov-Witten invariants of elliptic curves and, in particular, Hurwitz numbers.…
Given two elliptic curves defined over a number field K, not both with j-invariant zero, we show that there are infinitely many $D\in K^\times$ with pairwise distinct image in $ K^\times/{K^\times}^2 $, such that the quadratic twist of both…
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…
We describe an algorithm to compute the local component at p of the Coleman-Gross p-adic height pairing on divisors on hyperelliptic curves. As the height pairing is given in terms of a Coleman integral, we also provide new techniques to…
In this study, we introduce a new approach to curve pairs by using integral curves. We consider the direction curve and donor curve to study curve couples such as involute-evolute curves, Mannheim partner curves and Bertrand partner curves.…
We demonstrate a new approach to the computation of ratios of elliptic integrals. It turns out that almost closed polygons interscribed between two conics retain some of the properties of such closed polygons. We apply these retained…
A new characterization of rational torsion subgroups of elliptic curves is found, for points of order greater than 4, through the existence of solution for systems of Thue equations.
We construct pairs of elliptic curves over number fields with large intersection of projective torsion points.
In paper a new definition of reduced Pade approximant and algorithm for its computing is proposed. Our approach is based on the investigation of the kernel structure of the Toeplitz matrix. It is shown that the reduced Pade approximant…
We obtain new results concerning the Sato-Tate conjecture on the distribution of Frobenius traces over single and double parametric families of elliptic curves. We consider these curves for values of parameters having prescribed arithmetic…
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…
There are many numerical methods for solving partial different equations (PDEs) on manifolds such as classical implicit, finite difference, finite element, and isogeometric analysis methods which aim at improving the interoperability…
We show how the Eulcidean algorithm for polynomials can be used to find the intersection points, with multiplicities, of two plane algebraic curves.
We provide a framework for using elliptic curves with complex multiplication to determine the primality or compositeness of integers that lie in special sequences, in deterministic quasi-quadratic time. We use this to find large primes,…
Miyaji, Nakabayashi, and Takano proposed the algorithm for the construction of prime order pairing-friendly elliptic curves with embedding degrees $k=3,4,6$. We present a method for generating generalized MNT curves. The order of such…
We prove, with an unconditional effective error bound, the Sato-Tate distributions for two families of surfaces arising from products of elliptic curves, namely a one-parameter family of K3 surfaces and double quadric surfaces. To prove…
In this paper we introduce an algorithm of construction of cyclic space-filling curves. One particular construction provides a family of space-filling curves in all dimensions (H-curves). They are compared here with the Hilbert curve in the…
We present efficient algorithms for detecting central and mirror symmetry for the case of algebraic curves defined by means of polynomial parametrizations. The algorithms are based on the existence of a linear relationship between two…