Diffie-Hellman is as Strong as Discrete Log for Certain Primes
- 1 January 1990
- book chapter
- Published by Springer Nature
- p. 530-539
- https://doi.org/10.1007/0-387-34799-2_38
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Discrete logarithms in finite fields and their cryptographic significancePublished by Springer Nature ,2000
- An improved algorithm for computing logarithms overGF(p)and its cryptographic significance (Corresp.)IEEE Transactions on Information Theory, 1978
- New directions in cryptographyIEEE Transactions on Information Theory, 1976
- Theorems on factorization and primality testingMathematical Proceedings of the Cambridge Philosophical Society, 1974