Abstract
We describe another key-exchange system which, while based on the general idea of the well-known scheme of Diffie and Hellman, seems to be more secure than that technique. The new system is based on the arithmetic of an imaginary quadratic field, and makes use, specifically, of the properties of the class group of such a field.
Article PDF
Similar content being viewed by others
References
Johannes Buchmann and H. C. Williams, On principal ideal testing in algebraic number fields,J. Symbolic Comput. 4(1987), 11–19.
D. A. Buell, The expectation of success using a Monte-Carlo factoring method—some statistics on quadratic class numbers,Mach. Comp. 43(1984), 313–327.
H. Cohen and H. W. Lenstra Jr., Heuristics on class groups of number fields,Number Theory (Noordwijkerhout, 1983), Lecture Notes in Mathematics, vol. 1068, Springer-Verlag, Berlin, 1984, pp. 33–62.
H. Cohn,Advanced Number Theory, Dover, New York, 1980.
W. Diffie and M. Hellman, New directions in cryptography,IEEE Trans. Inform. Theory 2(1976), 472–492.
T. El Gamal, A public key cryptosystem and a signature scheme based on discrete logarithms,IEEE Trans. Inform. Theory 31(1985), 469–472.
Hua Loo Keng,Introduction to Number Theory, Springer-Verlag, Berlin, 1982.
N. Koblitz, Elliptic curve cryptosystems,Math. Comp. 48(1987), 203–209.
J. Lagarias, Worst-case complexity bounds for algorithms in the theory of integral quadratic forms,J. Algorithms 1(1980), 142–186.
H. W. Lenstra, Jr.,On the calculation of Regulators and Class Numbers of Quadratic Fields, London Mathematical Society Lecture Notes Series, vol. 56, Cambridge University Press, Cambridge, 1982, pp. 123–150.
J. E. Littlewood, On the class number of the corpus\(P(\sqrt { - k} )\),Proc. London Math. Soc. 27(1928), 358–372.
K. S. McCurley,A Key Distribution System Equivalent to Factoring, preprint, June 1987.
V. Miller, Use of elliptic curves in cryptosystems,Advances in Cryptology (Proceedings of Crypto '85), Lecture Notes in Computer Science, vol. 218, Springer-Verlag, New York, 1986, pp. 417–426.
W. Narkiewicz,Elementary and Analytic Theory of Algebraic Numbers, Warsaw, 1974.
A. Odlyzko, Discrete logarithms in finite fields and their cryptographic significance,Advances in Cryptology (Proceedings of Eurocrypt '84), Lecture Notes in Computer Science, vol. 209, Springer-Verlag, New York, 1985, pp. 224–314.
J. Oesterlé, Versions effectives du théorème de Chebotarev sous l'hypothése de Riemann généralisée,Astérisque 61(1979), 165–167.
S. Pohlig and M. Hellman, An improved algorithm for computing discrete logarithms over GF(p) and its cryptographic significance,IEEE Trans. Inform. Theory 24(1978), 106–110.
L. Rédei, Über die Klassenzahl des imaginären quadratischen Zahlkörpers,J. Reine Angew. Math. 159(1928), 210–219.
J. B. Rosser and L. Schoenfeld, Approximate formulas for some functions of prime numbers,Illinois J. Math. 6(1962), 64–94.
Z. Schmuely, Composite Diffie-Hellman public-key generating schemes are hard to break, Technical Repart No. 356, Computer Science Department, Technion-Israel Institute of Technology, February 1985.
R. Schoof, Quadratic fields and factorization,Computational Methods in Number Theory, Math Centrum Tracts, Number 155, Part II, Amsterdam, 1983, pp. 235–286.
D. Shanks,Class Number, a Theory of Factorization, and Genera, Proceedings of Symposia in Pure Mathematics, vol. 20, AMS. Providence, RI, 1971, pp. 415–440.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Buchmann, J., Williams, H.C. A key-exchange system based on imaginary quadratic fields. J. Cryptology 1, 107–118 (1988). https://doi.org/10.1007/BF02351719
Issue Date:
DOI: https://doi.org/10.1007/BF02351719