A Structural Comparison of the Computational Difficulty of Breaking Discrete Log Cryptosystems

• 1 January 1998
• journal article
• research article
• Published by Springer Nature in Journal of Cryptology
• Vol. 11  (1) , 29-43
• https://doi.org/10.1007/s001459900033

Abstract

Keywords

• KEY WORDS. CRYPTOSYSTEM
• COMPUTATIONAL NUMBER THEORY
• DISCRETE LOGARITHM
• ELLIPTIC CURVES
• KEY EXCHANGE
• PUBLIC-KEY CRYPTOGRAPHY
• RANDOMNESS
• SECURITY.