Mathematicians Crack the Code on High-Rank Genus-2 Curves in Cryptography

Mathematicians have made a breakthrough in understanding the ranks of genus-2 curves, a key area in number theory and cryptography. Their work establishes new lower bounds for how often these curves achieve high ranks, improving previous estimates significantly. The findings also introduce innovative methods for constructing such curves efficiently.

The research focused on genus-2 curves and their Jacobians, which are central to studying ranks in algebraic geometry. A team including Dimitar Jetchev, Maarten Derickx, and Bas Edixhoven developed a method for building genus-2 curves by combining elliptic curves. This approach allowed them to create a subfamily where the Jacobians have ranks of at least 1, achieving an unconditional logarithmic density of 1/40.

Another key result came from proving that the logarithmic density of genus-2 Jacobians with rank ≥1 is at least 13/14. The team also identified a large explicit subfamily where the Jacobians reach ranks of at least 2, with a density of at least 5/7. These improvements mark a substantial leap from earlier bounds.

Separately, researchers constructed a family of genus-2 curves with split Jacobians and rank 2, securing a logarithmic density of at least 2/21. The work builds on the Mordell-Weil theorem, which underpins the study of rank distribution in hyperelliptic curves. Additionally, the study clarified the computational effort required: finding curves of rank ≥1 can be done in O(X^1/2 + o(1)) time, while rank ≥2 curves demand O(X^2 + o(1)) trials.

Contributions from Razvan Barbulescu, Mugurel Barcau, Vicentiu Pasol, and George C. Turcas further advanced the understanding of logarithmic density in these Jacobians. Their combined efforts provide a clearer picture of how ranks are distributed among genus-2 curves, with direct implications for cryptographic applications.

The findings set a new benchmark for the proportion of genus-2 curves with high ranks, confirming a density of at least 13/14 for rank ≥1 and 5/7 for rank ≥2. The explicit construction methods and computational bounds developed in this research offer practical tools for further exploration. These results strengthen the theoretical foundation for cryptographic systems relying on hyperelliptic curves.