We use an invariant-theoretic method to compute certain twists of the modular curves $\def \xmlpi #1{}\def \mathsfbi #1{\boldsymbol {\mathsf {#1}}}\let \le =\leqslant \let \leq =\leqslant \let \ge =\geqslant \let \geq =\geqslant \def \Pr {\mathit {Pr}}\def \Fr {\mathit {Fr}}\def \Rey {\mathit {Re}}X(n)$ for $n=7,11$. Searching for rational points on these twists enables us to find non-trivial pairs of $n$-congruent elliptic curves over ${\mathbb{Q}}$, that is, pairs of non-isogenous elliptic curves over ${\mathbb{Q}}$ whose $n$-torsion subgroups are isomorphic as Galois modules. We also find a non-trivial pair of 11-congruent elliptic curves over ${\mathbb{Q}}(T)$, and hence give an explicit infinite family of non-trivial pairs of 11-congruent elliptic curves  over ${\mathbb{Q}}$.

Supplementary materials are available with this article.

We exhibit a numerical method to compute three-point branched covers of the complex projective line. We develop algorithms for working explicitly with Fuchsian triangle groups and their finite-index subgroups, and we use these algorithms to compute power series expansions of modular forms on these groups.

We explicitly construct the Kummer variety associated to the Jacobian of a hyperelliptic curve of genus 3 that is defined over a field of characteristic not equal to 2 and has a rational Weierstrass point defined over the same field. We also construct homogeneous quartic polynomials on the Kummer variety and show that they represent the duplication map using results of Stoll.

Supplementary materials are available with this article.

Let $\def \xmlpi #1{}\def \mathsfbi #1{\boldsymbol {\mathsf {#1}}}\let \le =\leqslant \let \leq =\leqslant \let \ge =\geqslant \let \geq =\geqslant \def \Pr {\mathit {Pr}}\def \Fr {\mathit {Fr}}\def \Rey {\mathit {Re}}\mathcal{O}$ be a maximal order in the quaternion algebra $B_p$ over $\mathbb{Q}$ ramified at $p$ and $\infty $. The paper is about the computational problem: construct a supersingular elliptic curve $E$ over $\mathbb{F}_p$ such that ${\rm End}(E) \cong \mathcal{O}$. We present an algorithm that solves this problem by taking gcds of the reductions modulo $p$ of Hilbert class polynomials.

New theoretical results are required to determine the complexity of our algorithm. Our main result is that, under certain conditions on a rank three sublattice $\mathcal{O}^T$ of $\mathcal{O}$, the order $\mathcal{O}$ is effectively characterized by the three successive minima and two other short vectors of $\mathcal{O}^T\! .$ The desired conditions turn out to hold whenever the $j$-invariant $j(E)$, of the elliptic curve with ${\rm End}(E) \cong \mathcal{O}$, lies in $\mathbb{F}_p$. We can then prove that our algorithm terminates with running time $O(p^{1+\varepsilon })$ under the aforementioned conditions.

As a further application we present an algorithm to simultaneously match all maximal order types with their associated $j$-invariants. Our algorithm has running time $O(p^{2.5 + \varepsilon })$ operations and is more efficient than Cerviño’s algorithm for the same problem.

This paper presents an algorithm to construct cryptographically strong genus $\def \xmlpi #1{}\def \mathsfbi #1{\boldsymbol {\mathsf {#1}}}\let \le =\leqslant \let \leq =\leqslant \let \ge =\geqslant \let \geq =\geqslant \def \Pr {\mathit {Pr}}\def \Fr {\mathit {Fr}}\def \Rey {\mathit {Re}}2$ curves and their Kummer surfaces via Rosenhain invariants and related Kummer parameters. The most common version of the complex multiplication (CM) algorithm for constructing cryptographic curves in genus 2 relies on the well-studied Igusa invariants and Mestre’s algorithm for reconstructing the curve. On the other hand, the Rosenhain invariants typically have much smaller height, so computing them requires less precision, and in addition, the Rosenhain model for the curve can be written down directly given the Rosenhain invariants. Similarly, the parameters for a Kummer surface can be expressed directly in terms of rational functions of theta constants. CM-values of these functions are algebraic numbers, and when computed to high enough precision, LLL can recognize their minimal polynomials. Motivated by fast cryptography on Kummer surfaces, we investigate a variant of the CM method for computing cryptographically strong Rosenhain models of curves (as well as their associated Kummer surfaces) and use it to generate several example curves at different security levels that are suitable for use in cryptography.

There is an algorithm of Schoof for finding divisors of class numbers of real cyclotomic fields of prime conductor. In this paper we introduce an improvement of the elliptic analogue of this algorithm by using a subgroup of elliptic units given by Weierstrass forms. These elliptic units which can be expressed in terms of $\def \xmlpi #1{}\def \mathsfbi #1{\boldsymbol {\mathsf {#1}}}\let \le =\leqslant \let \leq =\leqslant \let \ge =\geqslant \let \geq =\geqslant \def \Pr {\mathit {Pr}}\def \Fr {\mathit {Fr}}\def \Rey {\mathit {Re}}x$-coordinates of points on elliptic curves enable us to use the fast arithmetic of elliptic curves over finite fields.

In this paper we give a new formula for adding $2$-coverings and $3$-coverings of elliptic curves that avoids the need for any field extensions. We show that the $6$-coverings obtained can be represented by pairs of cubic forms. We then prove a theorem on the existence of such models with integer coefficients and the same discriminant as a minimal model for the Jacobian elliptic curve. This work has applications to finding rational points of large height on elliptic curves.

We present an efficient algorithm to compute the Hasse–Witt matrix of a hyperelliptic curve $\def \xmlpi #1{}\def \mathsfbi #1{\boldsymbol {\mathsf {#1}}}\let \le =\leqslant \let \leq =\leqslant \let \ge =\geqslant \let \geq =\geqslant \def \Pr {\mathit {Pr}}\def \Fr {\mathit {Fr}}\def \Rey {\mathit {Re}}C/\mathbb{Q}$ modulo all primes of good reduction up to a given bound $N$, based on the average polynomial-time algorithm recently proposed by the first author. An implementation for hyperelliptic curves of genus 2 and 3 is more than an order of magnitude faster than alternative methods for $N = 2^{26}$.

In this paper we consider ordinary elliptic curves over global function fields of characteristic $\def \xmlpi #1{}\def \mathsfbi #1{\boldsymbol {\mathsf {#1}}}\let \le =\leqslant \let \leq =\leqslant \let \ge =\geqslant \let \geq =\geqslant \def \Pr {\mathit {Pr}}\def \Fr {\mathit {Fr}}\def \Rey {\mathit {Re}}2$. We present a method for performing a descent by using powers of the Frobenius and the Verschiebung. An examination of the local images of the descent maps together with a duality theorem yields information about the global Selmer groups. Explicit models for the homogeneous spaces representing the elements of the Selmer groups are given and used to construct independent points on the elliptic curve. As an application we use descent maps to prove an upper bound for the naive height of an $S$-integral point on $A$. To illustrate our methods, a detailed example is presented.

Let $\def \xmlpi #1{}\def \mathsfbi #1{\boldsymbol {\mathsf {#1}}}\let \le =\leqslant \let \leq =\leqslant \let \ge =\geqslant \let \geq =\geqslant \def \Pr {\mathit {Pr}}\def \Fr {\mathit {Fr}}\def \Rey {\mathit {Re}}f\in S_2(\Gamma _0(N))$ be a normalized newform such that the abelian variety $A_f$ attached by Shimura to $f$ is the Jacobian of a genus-two curve. We give an efficient algorithm for computing Galois representations associated to such newforms.

This paper introduces ‘hyper-and-elliptic-curve cryptography’, in which a single high-security group supports fast genus-2-hyperelliptic-curve formulas for variable-base-point single-scalar multiplication (for example, Diffie–Hellman shared-secret computation) and at the same time supports fast elliptic-curve formulas for fixed-base-point scalar multiplication (for example, key generation) and multi-scalar multiplication (for example, signature verification).

We construct explicit $K3$ surfaces over $\mathbb{Q}$ having real multiplication. Our examples are of geometric Picard rank 16. The standard method for the computation of the Picard rank provably fails for the surfaces constructed.

We study the distribution of 2-Selmer ranks in the family of quadratic twists of an elliptic curve $\def \xmlpi #1{}\def \mathsfbi #1{\boldsymbol {\mathsf {#1}}}\let \le =\leqslant \let \leq =\leqslant \let \ge =\geqslant \let \geq =\geqslant \def \Pr {\mathit {Pr}}\def \Fr {\mathit {Fr}}\def \Rey {\mathit {Re}}E$ over an arbitrary number field $K$. Under the assumption that ${\rm Gal}(K(E[2])/K) \ {\cong }\ S_3$, we show that the density (counted in a nonstandard way) of twists with Selmer rank $r$ exists for all positive integers $r$, and is given via an equilibrium distribution, depending only on a single parameter (the ‘disparity’), of a certain Markov process that is itself independent of $E$ and $K$. More generally, our results also apply to $p$-Selmer ranks of twists of two-dimensional self-dual ${\bf F}_p$-representations of the absolute Galois group of $K$ by characters of order $p$.

Weinvestigate the Hasse principle for complete intersections cut out by a quadric hypersurface and a cubic hypersurface defined over the rational numbers.

The $p$-cohomology of an algebraic variety in characteristic $p$ lies naturally in the category $D_{c}^{b}(R)$ of coherent complexes of graded modules over the Raynaud ring (Ekedahl, Illusie, Raynaud). We study homological algebra in this category. When the base field is finite, our results provide relations between the absolute cohomology groups of algebraic varieties, log varieties, algebraic stacks, etc., and the special values of their zeta functions. These results provide compelling evidence that $D_{c}^{b}(R)$ is the correct target for $p$-cohomology in characteristic $p$.

We construct an elliptic curve over the field of rational functions with torsion group $\mathbb{Z}/2\mathbb{Z}\times \mathbb{Z}/4\mathbb{Z}$ and rank equal to four, and an elliptic curve over $\mathbb{Q}$ with the same torsion group and rank nine. Both results improve previous records for ranks of curves of this torsion group. They are obtained by considering elliptic curves induced by Diophantine triples.

We give a separability criterion for the polynomials of the form

$$\begin{equation*} ax^{2n + 2} + (bx^{2m} + c)(d x^{2k} + e). \end{equation*}$$

$$\begin{equation*} z^2 = ax^{2n + 2} + (bx^{2m} + c)(d x^{2k} + e) \end{equation*}$$

Let $Q(N;q,a)$ be the number of squares in the arithmetic progression $qn+a$, for $n=0$,$1,\ldots,N-1$, and let $Q(N)$ be the maximum of $Q(N;q,a)$ over all non-trivial arithmetic progressions $qn + a$. Rudin’s conjecture claims that $Q(N)=O(\sqrt{N})$, and in its stronger form that $Q(N)=Q(N;24,1)$ if $N\ge 6$. We prove the conjecture above for $6\le N\le 52$. We even prove that the arithmetic progression $24n+1$ is the only one, up to equivalence, that contains $Q(N)$ squares for the values of $N$ such that $Q(N)$ increases, for $7\le N\le 52$ ($N=8,13,16,23,27,36,41$ and $52$).

Supplementary materials are available with this article.

We construct new indecomposable elements in the higher Chow group $CH^2(A,1)$ of a principally polarized Abelian surface over a $p$-adic local field, which generalize an element constructed by Collino [Griffiths’ infinitesimal invariant and higher K-theory on hyperelliptic Jacobians, J. Algebraic Geom. 6 (1997), 393–415]. These elements are constructed using a generalization, due to Birkenhake and Wilhelm [Humbert surfaces and the Kummer plane, Trans. Amer. Math. Soc. 355 (2003), 1819–1841 (electronic)], of a classical construction of Humbert. They can be used to prove a non-Archimedean analogue of the Hodge-${\mathcal{D}}$-conjecture – namely, the surjectivity of the boundary map in the localization sequence – in the case where the Abelian surface has good and ordinary reduction.