arXiv · 2608.03268
On pairs of primes with small order reciprocity
Abstract
We give a sieving algorithm for finding pairs of primes with small multiplicative orders modulo each other. This problem is a necessary condition for obtaining constructions of $2$-cycles of pairing-friendly curves, which have found use in cryptographic applications. Our database of examples suggests that, except for a well-known infinite family of such primes, instances become increasingly rare as the size of the primes increase. This leads to some interesting open questions for which we hope our database prompts further investigation.
Explore related subjects
Keep this discovery
Craig Costello, Gaurish Korpal. 2026-08-04. On pairs of primes with small order reciprocity. https://doi.org/10.1090/conm%2F840%2F16821
Cite the original work for its findings. Save a collection to share your selection of sources.