The Probability Distribution of the Diffie-Hellman Key

作者: Christian P. Waldvogel , James L. Massey

DOI: 10.1007/3-540-57220-1_87

关键词:

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

参考文章(4)
Rudolf Lidl, Harald Niederreiter, Introduction to finite fields and their applications The Mathematical Gazette. ,vol. 72, pp. 335- ,(1986) , 10.1017/CBO9781139172769
S. Pohlig, M. Hellman, An improved algorithm for computing logarithms over GF(p) and its cryptographic significance (Corresp.) IEEE Transactions on Information Theory. ,vol. 24, pp. 106- 110 ,(1978) , 10.1109/TIT.1978.1055817
L. J. Mordell, G. H. Hardy, E. M. Wright, An Introduction to the Theory of Numbers The Mathematical Gazette. ,vol. 23, pp. 174- ,(1939) , 10.2307/3607021