Related papers: Two-sources Randomness Extractors for Elliptic Cur…

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…

We combine the exact counting of all elliptic curves over $K = \mathbb{F}_q(t)$ with $\mathrm{char}(K) > 3$ by Bejleri, Satriano and the author, together with the torsion-free nature of most elliptic curves over global function fields…

In this paper we give an upper bound for the number of integral points on an elliptic curve E over F_q[T] in terms of its conductor N and q. We proceed by applying the lower bounds for the canonical height that are analogous to those given…

We describe a straightforward method to generate a random prime q such that the multiplicative group GF(q)* also has a random large prime-order subgroup. The described algorithm also yields this order p as well as a p'th primitive root of…

In this paper, $p$ and $q$ are two different odd primes. First, We construct the congruent elliptic curves corresponding to $p$, $2p$, $pq$, and $2pq,$ then, in the cases of congruent numbers, we determine the rank of the corresponding…

We present an algorithm that, on input of a positive integer N together with its prime factorization, constructs a finite field F and an elliptic curve E over F for which E(F) has order N. Although it is unproved that this can be done for…

We prove quantitative upper bounds for the number of quadratic twists of a given elliptic curve $E/\Fp_q(C)$ over a function field over a finite field that have rank $\geq 2$, and for their average rank. The main tools are constructions and…

For positive integers $K$ and $L$, we introduce and study the notion of $K$-multiplicative dependence over the algebraic closure $\overline{\mathbb{F}}_p$ of a finite prime field $\mathbb{F}_p$, as well as $L$-linear dependence of points on…

Locally repairable codes with availability have become essential components in modern large-scale distributed cloud storage systems and numerous other applications. In this paper, we focus on the construction of locally repairable codes…

Elliptic curves with a known number of points over a given prime field with n elements are often needed for use in cryptography. In the context of primality proving, Atkin and Morain suggested the use of the theory of complex multiplication…

In the past years, research on Shor's algorithm for solving elliptic curves for discrete logarithm problems (Shor's ECDLP), the basis for cracking elliptic curve-based cryptosystems (ECC), has started to garner more significant interest. To…

For any number field $K$ and integer $0\leq r \leq 4$, we prove that there are infinitely many elliptic curves over $K$ of rank $r$. Our elliptic curves are obtained by specializing well-chosen nonisotrivial elliptic curves over the…

In this paper, we propose an elliptic curve key generation processor over GF(2m) and GF(P) with Network-on-Chip (NoC) design scheme based on binary scalar multiplication algorithm. Over the Two last decades, Elliptic Curve Cryptography…

We overview a series of recent works addressing numerical simulations of partial differential equations in the presence of some elements of randomness. The specific equations manipulated are linear elliptic, and arise in the context of…

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…

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…

Let q be a power of a prime and E be an elliptic curve defined over F_q. In "Combinatorial aspects of elliptic curves" [17], the present author examined a sequence of polynomials which express the N_k's, the number of points on E over the…

In this paper, we show that the maximal divisible subgroup of groups $K_1$ and $K_2$ of an elliptic curve $E$ over a function field is uniquely divisible. Further those $K$-groups modulo this uniquely divisible subgroup are explicitly…

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…

In this paper, we study the problem of sampling random supersingular elliptic curves with unknown endomorphism rings. This problem has recently gained considerable attention as many isogeny-based cryptographic protocols require such…