Abstract.
We present efficient algorithms for computing discrete logarithms in the class group of a quadratic order and for principality testing in a real quadratic order, based on the work of Düllmann and Abel. We show how the idea of generating relations with sieving can be applied to improve the performance of these algorithms. Computational results are presented which demonstrate that our new techniques yield a significant increase in the sizes of discriminants for which these discrete logarithm problems can be solved.
Article PDF
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received 25 November 1999 and revised 29 March 2000 Online publication 15 September 2000
Rights and permissions
About this article
Cite this article
Jacobson, M. Computing Discrete Logarithms in Quadratic Orders. J. Cryptology 13, 473–492 (2000). https://doi.org/10.1007/s001450010013
Published:
Issue Date:
DOI: https://doi.org/10.1007/s001450010013