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

Let $E_1, \ldots, E_s $ be $s$, not necessary distinct, elliptic curves over $\mathbb{Q}$. We give upper bounds on the frequency of $s$-tuples of points in $E_1(\mathbb{Q})\times \ldots \times E_s(\mathbb{Q})$ whose denominators or…

Let $p$ be a prime and let $K$ be a finite extension of $\mathbb{Q}_p$. Let $E/K$ be an elliptic curve with additive reduction. In this paper, we study the topological group structure of the set of points of good reduction of $E(K)$. In…

Let $p\ge5$ be a prime and $T$ a Kodaira type of the special fiber of an elliptic curve. We estimate the number of elliptic curves over $\mathbb Q$ up to height $X$ with Kodaira type $T$ at $p$. This enables us find the proportion of…

Given a minimal model of an elliptic curve, $E/K$, over a finite extension, $K$, of ${\mathbb Q}_{p}$ for any rational prime, $p$, and any point $P \in E(K)$ of infinite order, we determine precisely $\min \left( v \left( \phi_{n}(P)…

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

Quantum random number generators can provide genuine randomness by appealing to the fundamental principles of quantum mechanics. In general, a physical generator contains two parts---a randomness source and its readout. The source is…

Let $E$ be an elliptic curve defined over $\mathbb{Q}$. For a quadratic number field $K$ and an odd prime number $p$, let $L$ be a $\mathbb{Z}_p$-extension of $K$. We prove that $E(L)_{\text{tors}}=E(K)_{\text{tors}}$ when $p>5$. It enables…

Let $P$ be an arbitrary point on an elliptic curve over the complex numbers of the form $y^2=x^3+a_4\,x+a_6$ or of the form $y^2=x^3+a_2\,x^2+a_4\,x$. We provide explicit formulae to compute the points $P/2$, i.e., the points $Q$ such that…

Let O be a maximal order in the quaternion algebra B_p over Q ramified at p and infinity. The paper is about the computational problem: Construct a supersingular elliptic curve E over F_p such that End(E) = O. We present an algorithm that…

Elliptic curve cryptography (ECC) is foundational to modern secure communication, yet existing standard curves have faced scrutiny for opaque parameter-generation practices. This work introduces a Selmer-inspired framework for constructing…

We report major advances in the research program initiated in "Moment-Based Evidence for Simple Rational-Valued Hilbert-Schmidt Generic 2 x 2 Separability Probabilities" (J. Phys. A, 45, 095305 [2012]). A highly succinct separability…

We present a new approach to handling the case of Atkin primes in Schoof's algorithm for counting points on elliptic curves over finite fields. Our approach is based on the theory of polynomially cyclic algebras, which we recall as far as…

Elliptic curve cryptography (ECC) is a remarkable mathematical tool that offers the same level of security as traditional public-key cryptography (PKC) with a significantly smaller key size and lower computational requirements. The use of…

Shor's quantum algorithm for discrete logarithms applied to elliptic curve groups forms the basis of a "quantum attack" of elliptic curve cryptosystems. To implement this algorithm on a quantum computer requires the efficient implementation…

Isogenies occur throughout the theory of elliptic curves. Recently, the cryptographic protocols based on isogenies are considered as candidates of quantum-resistant cryptographic protocols. Given two elliptic curves $E_1, E_2$ defined over…

This work has two main purposes. On the one side we investigate in this work a question of H. Esnault on congruence formula in a construction of H. Esnault and C. Xu for the number of rational points on the closed fiber of a singular model…

Let $E$ be an elliptic curve defined over a number field $K$. We say that a prime number $p$ is exceptional for $(E,K)$ if $E$ admits a $p$-isogeny defined over $K$. The so-called exceptional set of all such prime numbers is finite if and…

We present a fast algorithm that takes as input an elliptic curve defined over $\mathbb Q$ and an integer $d$ and returns all the number fields $K$ of degree $d'$ dividing $d$ such that $E(K)_{tors}$ contains $E(F)_{tors}$ as a proper…

Loops and cycles play an important role in computing endomorphism rings of supersingular elliptic curves and related cryptosystems. For a supersingular elliptic curve $E$ defined over $\mathbb{F}_{p^2}$, if an imaginary quadratic order $O$…

We design a probabilistic algorithm for computing endomorphism rings of ordinary elliptic curves defined over finite fields that we prove has a subexponential runtime in the size of the base field, assuming solely the generalized Riemann…