arXiv subjects

Andrew V. Sutherland

Publications and source records attributed to Andrew V. Sutherland.

61 records · Page 4Linked to original sources

arXiv2011

A low-memory algorithm for finding short product representations in finite groups

We describe a space-efficient algorithm for solving a generalization of the subset sum problem in a finite group G, using a Pollard-rho approach. Given an element z and a sequence of elements S, our algorithm attempts to find a subsequence of S whose product in G is equal to z. For a random sequence S of length d log_2 n, where n=#G and d >= 2 is a constant, we find that its expected running time is O(sqrt(n) log n) group operations (we give a rigorous proof for d > 4), and it only needs to store O(1) group elements. We consider applications to class groups of imaginary quadratic fields, and to finding isogenies between elliptic curves over a finite field.

math.NT↗

arXiv2010

Hyperelliptic curves, L-polynomials, and random matrices

We analyze the distribution of unitarized L-polynomials Lp(T) (as p varies) obtained from a hyperelliptic curve of genus g <= 3 defined over Q. In the generic case, we find experimental agreement with a predicted correspondence (based on the Katz-Sarnak random matrix model) between the distributions of Lp(T) and of characteristic polynomials of random matrices in the compact Lie group USp(2g). We then formulate an analogue of the Sato-Tate conjecture for curves of genus 2, in which the generic distribution is augmented by 22 exceptional distributions, each corresponding to a compact subgroup of USp(4). In every case, we exhibit a curve closely matching the proposed distribution, and can find no curves unaccounted for by our classification.

math.NT↗

arXiv2010

Class invariants by the CRT method

We adapt the CRT approach for computing Hilbert class polynomials to handle a wide range of class invariants. For suitable discriminants D, this improves its performance by a large constant factor, more than 200 in the most favourable circumstances. This has enabled record-breaking constructions of elliptic curves via the CM method, including examples with |D|>10^15.

math.NT↗

arXiv2010

An explicit height bound for the classical modular polynomial

For a prime m, let Phi_m be the classical modular polynomial, and let h(Phi_m) denote its logarithmic height. By specializing a theorem of Cohen, we prove that h(Phi_m) <= 6 m log m + 16 m + 14 sqrt m log m. As a corollary, we find that h(Phi_m) <= 6 m log m + 18 m also holds. A table of h(Phi_m) values is provided for m <= 3607.

math.NT↗

arXiv2009

On a theorem of Mestre and Schoof

A well known theorem of Mestre and Schoof implies that the order of an elliptic curve E over a prime field F_q can be uniquely determined by computing the orders of a few points on E and its quadratic twist, provided that q > 229. We extend this result to all finite fields with q > 49, and all prime fields with q > 29.

math.NT↗

arXiv2009

Computing the endomorphism ring of an ordinary elliptic curve over a finite field

We present two algorithms to compute the endomorphism ring of an ordinary elliptic curve E defined over a finite field F_q. Under suitable heuristic assumptions, both have subexponential complexity. We bound the complexity of the first algorithm in terms of log q, while our bound for the second algorithm depends primarily on log |D_E|, where D_E is the discriminant of the order isomorphic to End(E). As a byproduct, our method yields a short certificate that may be used to verify that the endomorphism ring is as claimed.

math.NT↗

arXiv2008

A Generic Approach to Searching for Jacobians

We consider the problem of finding cryptographically suitable Jacobians. By applying a probabilistic generic algorithm to compute the zeta functions of low genus curves drawn from an arbitrary family, we can search for Jacobians containing a large subgroup of prime order. For a suitable distribution of curves, the complexity is subexponential in genus 2, and O(N^{1/12}) in genus 3. We give examples of genus 2 and genus 3 hyperelliptic curves over prime fields with group orders over 180 bits in size, improving previous results. Our approach is particularly effective over low-degree extension fields, where in genus 2 we find Jacobians over F_{p^2) and trace zero varieties over F_{p^3} with near-prime orders up to 372 bits in size. For p = 2^{61}-1, the average time to find a group with 244-bit near-prime order is under an hour on a PC.

math.NT↗