Related papers: Primality proving using elliptic curves with compl…

We give explicit numerical estimates for the generalized Chebyshev functions. Explicit results of this kind are useful for estimating of computational complexity of algorithms which generates special primes. Such primes are needed to…

We describe deterministic and probabilistic algorithms to determine whether or not a given monic irreducible polynomial H in Z[X] is a Hilbert class polynomial, and if so, which one. These algorithms can be used to determine whether a given…

We consider some problems of analytic number theory for elliptic curves which can be considered as analogues of classical questions around the distribution of primes in arithmetic progressions to large moduli, and of the question of twin…

Let $a,b>0$ be coprime integers. Assuming a conjecture on Hecke eigenvalues along binary cubic forms, we prove an asymptotic formula for the number of primes of the form $ax^2+by^3$ with $x \leq X^{1/2}$ and $y \leq X^{1/3}$. The proof…

We present the first algorithm for computing class groups and unit groups of arbitrary number fields that provably runs in probabilistic subexponential time, assuming the Extended Riemann Hypothesis (ERH). Previous subexponential algorithms…

In this paper we shall investigate the problem of the representation of the number of integral points of an elliptic curve modulo a prime number p. We present a way of expressing an exponential sum which involves polynomials of third…

Let $ p $ and $ q $ be odd prime numbers with $ q - p = 2, $ the $\varphi -$Selmer groups, Shafarevich-Tate groups ($ \varphi - $ and $ 2-$part) and their dual ones as well the Mordell-Weil groups of elliptic curves $ y^{2} = x (x \pm p) (x…

Let E be an elliptic curve having complex multiplication by a given quadratic order of an imaginary quadratic field K. The field of definition of E is the ring class field Omega of the order. If the prime p splits completely in Omega, then…

Odd numbers can be indexed by the map k(n)=(n-3)/2, n belonging to 2N+3. We first propose a basic primality test using this index function that was first introduced in article (8). Input size of operations is reduced which improves…

We prove the $p$-parity conjecture for elliptic curves over global fields of characteristic $p > 3$. We also present partial results on the $\ell$-parity conjecture for primes $\ell \neq p$.

A class number formula is proved for extended ring class fields $L_{\mathcal{O},9}$ over imaginary quadratic fields $K_d = \mathbb{Q}(\sqrt{-d})$, in which the prime $p = 3$ splits, by determining the fields generated by the periodic points…

We consider the construction of the fundamental function and Abelian differentials of the third kind on a plane algebraic curve over the field of complex numbers that has no singular points. The algorithm for constructing differentials of…

Let $K$ be a number field. For which primes $p$ does there exist an elliptic curve $E / K$ admitting a $K$-rational $p$-isogeny? Although we have an answer to this question over the rationals, extending this to other number fields is a…

In this paper we study the problem of how to determine all elliptic curves defined over an arbitrary number field $K$ with good reduction outside a given finite set of primes $S$ of $K$ by solving $S$-unit equations. We give examples of…

Recently, the entanglement dynamics of two harmonic oscillators initially prepared in a separable-coherent state was demonstrated to offer a pathway for prime number identification. This article presents a generalized approach and outlines…

We present normal forms for elliptic curves over a field of characteristic $2$ analogous to Edwards normal form, and determine bases of addition laws, which provide strikingly simple expressions for the group law. We deduce efficient…

We present a very efficient algorithm to construct an elliptic curve E and a finite field F such that the order of the point group E(F) is a given prime number N. Heuristically, this algorithm only takes polynomial time Otilde((\log N)^3),…

Given a non-isotrivial elliptic curve over $\mathbb{Q}(t)$ with large Mordell-Weil rank, we explain how one can build, for suitable small primes $p$, infinitely many fields of degree $p^2-1$ whose ideal class group has a large $p$-torsion…

For smooth finite fields $F_q$ (i.e., when $q-1$ factors into small primes) the Fast Fourier Transform (FFT) leads to the fastest known algebraic algorithms for many basic polynomial operations, such as multiplication, division,…

This paper presents algorithmic approaches to study superspecial hyperelliptic curves. The algorithms proposed in this paper are: an algorithm to enumerate superspecial hyperelliptic curves of genus $g$ over finite fields $\mathbb{F}_q$,…