相关论文: Distribution of elliptic twins over fixed finite f…

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 E be an elliptic curve over Q. In 1988, Koblitz conjectured a precise asymptotic for the number of primes p up to x such that the order of the group of points of E over the finite field F_p is prime. This is an analogue of the Hardy and…

Short Weierstrass's elliptic curves with underlying hard Elliptic Curve Discrete Logarithm Problems was widely used in Cryptographic applications. This paper introduces a new security notation 'trusted security' for computation methods of…

Let $E$ be an elliptic curve over $\Q$ without complex multiplication, and which is not isogenous to a curve with non-trivial rational torsion. For each prime $p$ of good reduction, let $|E(\F_p)|$ be the order of the group of points of the…

Whilst many key exchange and digital signature systems still rely on NIST P-256 (secp256r1) and secp256k1, offering around 128-bit security, there is an increasing demand for transparent and reproducible curves at the 256-bit security…

In 2015, Abatzoglou, Silverberg, Sutherland, and Wong presented a framework for primality proving algorithms for special sequences of integers using an elliptic curve with complex multiplication. They applied their framework to obtain…

We give a deterministic algorithm that very quickly proves the primality or compositeness of the integers N in a certain sequence, using an elliptic curve E/Q with complex multiplication by the ring of integers of Q(sqrt(-7)). The algorithm…

Computer experiments reveal that twin primes tend to center on nonsquarefree multiples of 6 more often than on squarefree multiples of 6 compared to what should be expected from the ratio of the number of nonsquarefree multiples of 6 to the…

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…

In 2009, W. D. Banks and I. E. Shparlinski studied the average densities of primes $p \leq x$ for which the reductions of elliptic curves of small height modulo $p$ satisfy certain arithmetic properties, namely cyclicity and divisibility of…

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

Given non-CM elliptic curves $E_1$ and $E_2$ over $\mathbb{Q}$, we study the natural density of primes $p$ of good reduction for which the orders of the groups $E_1(\mathbb{F}_p)$ and $E_2(\mathbb{F}_p)$ are coprime. This problem may be…

We adopt an empirical approach to the characterization of the distribution of twin primes within the set of primes, rather than in the set of all natural numbers. The occurrences of twin primes in any finite sequence of primes are like…

The development of secure cryptographic protocols and the subsequent attack mechanisms have been placed in the literature with the utmost curiosity. While sophisticated quantum attacks bring a concern to the classical cryptographic…

Given an elliptic curve $E$ defined over the rational numbers and a prime $p$ at which $E$ has good reduction, we consider the Galois deformation ring parametrizing lifts of the residual representation on the $p$-torsion group $E[p]$. For a…

Following Lang and Trotter we describe a probabilistic model that predicts the distribution of primes $p$ with given Frobenius traces at $p$ for two fixed elliptic curves over $\mathbb{Q}$. In addition, we propose explicit Euler product…

Fix a prime number $p$. Let $\mathbb{F}_q$ be a finite field of characteristic coprime to 2, 3, and $p$, which also contains the primitive $p$-th root of unity $\mu_p$. Based on the works by Swinnerton-Dyer and Klagsbrun, Mazur, and Rubin,…

It is shown that, under some mild technical conditions, representations of prime numbers by binary quadratic forms can be computed in polynomial complexity by exploiting Schoof's algorithm, which counts the number of $\mathbb F_q$-points of…

We discuss the use of elliptic curves in cryptography on high-dimensional surfaces. In particular, instead of a Diffie-Hellman key exchange protocol written in the form of a bi-dimensional row, where the elements are made up with 256 bits,…

We study stable curves of arithmetic genus 2 which admit two morphisms of finite degree $p$, resp. $d$, onto smooth elliptic curves, with particular attention to the case $p$ prime.