The probability distribution of the Diffie-Hellman key

6Citations
Citations of this article
31Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The probability distribution of the key generated by the Diffe-Hellman Public Key-Distribution system is derived. For different prime factorizations of p – 1, where p is the prime modulus of the Diffe-Hellman system, the probabilities of the most and the least likely Diffe-Hellman key are found. A lower bound for the entropy of the Diffie-Hellman key is also derived. For the case p – 1 = 2q, with q prime, it is shown that the key distribution is very dose to the uniform distribution and the key entropy is virtually the maximum possible. A tight upper bound on the probability of the most likely key is also derived, from which the form of the prime factorization of p – 1 maximizing the probability of the most likely Diffie-Hellman key is found. The conditions for generating equally likely Diffie-Hellman keys for any prime factorization of p – 1 is given.

Cite

CITATION STYLE

APA

Waldvogel, C. P., & Massey, J. L. (1993). The probability distribution of the Diffie-Hellman key. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 718 LNCS, pp. 492–504). Springer Verlag. https://doi.org/10.1007/3-540-57220-1_87

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free