Related papers: Primality proving using elliptic curves with compl…
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…
We revisit and generalize some geometric techniques behind deterministic primality testing for some integer sequences using curves of genus 1 over finite rings. Subsequently we develop a similar primality test using the Jacobian of a genus…
Classical theory of Complex Multiplication (CM) shows that all abelian extensions of a complex quadratic field $K$ are generated by the values of appropriate modular functions at the points of finite order of elliptic curves whose…
We give a Euclidean division algorithm for the real quadratic fields $\mathbb{Q}(\sqrt{m})$ for $m \in \{2, 3, 6, 7, 11, 19\}$, with the property that the norm of the remainder depends on the first Euclidean minimum of the field. In each…
For any odd prime $p,$ we construct an infinite family of pairs of imaginary quadratic fields $\mathbb{Q}(\sqrt{d}),\mathbb{Q}(\sqrt{d+1})$ whose class numbers are both divisible by $p.$ One of our theorems settles Iizuka's conjecture for…
We quantify a recent theorem of Wiles on class numbers of imaginary quadratic fields by proving an estimate for the number of negative fundamental discriminants down to -X whose class numbers are indivisible by a given prime and whose…
In 2016, in the work related to Galois representations, Greenberg conjectured the existence of multi-quadratic $p$-rational number fields of degree $2^{t}$ for any odd prime number $p$ and any integer $t \geq 1$. Using the criteria provided…
In this paper, we obtain an asymptotic formula for the number of imaginary quadratic fields with prime discriminant and class number up to $H$, as $H\to \infty$. Previously, such an asymptotic was only known under the assumption of the…
A new algorithms for computing discrete logarithms on elliptic curves defined over finite fields is suggested. It is based on a new method to find zeroes of summation polynomials. In binary elliptic curves one is to solve a cubic system of…
This paper presents a novel primality test based on the eigenvalue structure of circulant matrices constructed from roots of unity. We prove that an integer $n > 2$ is prime if and only if the minimal polynomial of the circulant matrix $C_n…
We present two distinct families of imaginary biquadratic fields, each of which contains infinitely many members, with each member having large class groups. Construction of the first family involves elliptic curves and their quadratic…
We develop an algebraic framework over arbitrary quadratic fields $L = \mathbb{Q}(\sqrt{D})$ to generalize the Miller-Rabin primality test. Consequently, we present a deterministic primality test for integers of the form $N = K p^{\ell} -…
Let $K=\mathbb{Q}(\sqrt{-p})$ be a quadratic field for an odd prime $p$. We show that there exist infinitely many primes $p$ for which no elliptic curve $E/\mathbb{Q}$ has torsion subgroup $\mathbb{Z}/2\mathbb{Z}\times…
The arithmetic of elliptic curves, namely polynomial addition and scalar multiplication, can be described in terms of global sections of line bundles on $E\times E$ and $E$, respectively, with respect to a given projective embedding of $E$…
By reformulating and extending results of Elkies, we prove some results on $\mathbb Q$-curves over number fields of odd degree. We show that, over such fields, the only prime isogeny degrees~$\ell$ which an elliptic curve without CM may…
We survey algorithms for computing isogenies between elliptic curves defined over a field of characteristic either 0 or a large prime. We introduce a new algorithm that computes an isogeny of degree $\ell$ ($\ell$ different from the…
Let $D$ be a square-free integer other than 1. Let $K$ be the quadratic field ${\mathbb Q}(\sqrt D)$. Let $\delta \in \{1,2\}$ with $\delta=2$ if $D\equiv 1 \pmod 4$. To each prime ideal $\mathcal P$ in $K$ that splits in $K/\mathbb Q$ we…
We prove lower bounds of the form $\gg N/(\log N)^{3/2}$ for the number of primes up to $N$ primitively represented by a shifted positive definite integral binary quadratic form, and under the additional condition that primes are from an…
Let $p$ be an odd prime number. We propose an algorithm for computing rational representations of isogenies between Jacobians of hyperelliptic curves via-adic differential equations with a sharp analysis of the loss of precision.…
A representation of finite fields that has proved useful when implementing finite field arithmetic in hardware is based on an isomorphism between subrings and fields. In this paper, we present an unified formulation for multiplication in…