Abstract
In [3] and [1] a new key exchange system was introduced whose security is related to the difficulty of solving the discrete logarithm problem in the class group of imaginary quadratic orders. Subsequently, in [5] and [4] a subexponential algorithm for computing those class groups was presented and it was shown how to use this algorithm and the index-calculus method to calculate discrete logarithms.
Chapter PDF
Similar content being viewed by others
References
J. Buchmann, S. Düllmann, H.C. Williams, On the complexity and efficiency of a new key exchange system, Proceedings EUROCRYPT’89, to appear.
J. Buchmann, S. Düllmann, A probabilistic class group and regulator algorithm and its implementation, Proceedings Colloquium on Computational Number Theory, Debrecen 1989, to appear.
J. Buchmann, H.C. Williams, A key exchange system based on imaginary quadratic fields, J. Cryptology 1 (1988), 107–118.
J.L. Hafner, K.S. McCurley, A rigorous subexponential algorithm for computation of class groups, Journal AMS, to appear.
K.S. McCurley, Cryptographic key distribution and computation in class groups, Proceeding of NATO ASI Number Theory and Applications, Kluwer Academic Publishers 1989, 459–479.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Buchmann, J., Düllmann, S. (1991). On the Computation of Discrete Logarithms in Class Groups. In: Menezes, A.J., Vanstone, S.A. (eds) Advances in Cryptology-CRYPTO’ 90. CRYPTO 1990. Lecture Notes in Computer Science, vol 537. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-38424-3_9
Download citation
DOI: https://doi.org/10.1007/3-540-38424-3_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54508-8
Online ISBN: 978-3-540-38424-3
eBook Packages: Springer Book Archive