On Diffie-Hellman Key Agreement with Short Exponents

This publication has 15 references indexed in Scilit:

• Comparison of three modular reduction functions
  Published by Springer Nature ,2001
• Towards the Equivalence of Breaking the Diffie-Hellman Protocol and Computing Discrete Logarithms
  Published by Springer Nature ,2001
• Factoring by electronic mail
  Published by Springer Nature ,2001
• A Note on Discrete Logarithms with Special Structure
  Published by Springer Nature ,2001
• N Using RSA with Low Exponent in a Public Key Network
  Published by Springer Nature ,2000
• Fast generation of prime numbers and secure public-key cryptographic parameters
  Journal of Cryptology, 1995
• Computation of discrete logarithms in prime fields
  Designs, Codes and Cryptography, 1991
• The discrete logarithm problem
  Published by American Mathematical Society (AMS) ,1991
• Monte Carlo Methods for Index Computation (mod p)
  Mathematics of Computation, 1978
• An improved algorithm for computing logarithms overGF(p)and its cryptographic significance (Corresp.)
  IEEE Transactions on Information Theory, 1978