A proof of the conjectured run time of the Hafner-McCurley class group algorithm

Abstract

<p style='text-indent:20px;'>We present a proof under a generalization of the Riemann Hypothesis that the class group algorithm of Hafner and McCurley runs in expected time <inline-formula><tex-math id="M1">\begin{document}$ e^{\left(3/\sqrt{8}+o(1)\right)\sqrt{\log d\log\log d}} $\end{document}</tex-math></inline-formula> where <inline-formula><tex-math id="M2">\begin{document}$ -d $\end{document}</tex-math></inline-formula> is the discriminant of the input imaginary quadratic order. In the original paper, an expected run time of <inline-formula><tex-math id="M3">\begin{document}$ e^{\left(\sqrt{2}+o(1)\right)\sqrt{\log d\log\log d}} $\end{document}</tex-math></inline-formula> was proven, and better bounds were conjectured. To achieve a proven result, we rely on a mild modification of the original algorithm, and on recent results on the properties of the Cayley graph of the ideal class group.</p>