Wuhan University Journal of Natural Sciences

, Volume 11, Issue 6, pp 1715–1717 | Cite as

Security analysis of discrete logarithm based cryptosystems

  • Wang Yuzhu
  • Liao Xiaofeng
Security of Network and Communication


Discrete logarithm based cryptosystems have subtle problems that make the schemes vulnerable. This paper gives a comprehensive listing of security issues in the systems and analyzes three classes of attacks which are based on mathematical structure of the group which is used in the schemes, the disclosed information of the subgroup and implementation details respectively. The analysis will, in turn, allow us to motivate protocol design and implementation decisions.

Key words

discrete logarithm security analysis prime order subgroup secure implementation 

CLC number

TP 309 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    ElGamal T. A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms [J].IEEE Inform Theory, 1985,IT-31(4):469–472.MATHCrossRefMathSciNetGoogle Scholar
  2. [2]
    FIPS 186.Digital Signature Standard, Federal Information Processing Standards Publication 186[S]. Washington DC: Department of Commerce/NIST, 1994.Google Scholar
  3. [3]
    Pollard J. Monte Carlo Methods for Index Computation Mod p[J].Math Comp, 1978,32:918–924.MATHCrossRefMathSciNetGoogle Scholar
  4. [4]
    Pohlig S C, Hellman M E. An Improved Algorithm for Computing Logarithms Over GF (p) and Its Cryptographic Significance [J].IEEE Inform Theory, 1978,IT-24(1): 106–110.MATHCrossRefMathSciNetGoogle Scholar
  5. [5]
    Lim C H, Lee P J. A Key Recovery Attack on Discrete Log-Based Schemes Using a Prime Order Subgroup [J].Advances in Cryptology. 1997,20:249–263.MathSciNetGoogle Scholar
  6. [6]
    Diffie W, Hellman M E. New Direction in Cryptography [J].IEEE Trans Inform Theory, 1976,22(6):644–654.MATHCrossRefMathSciNetGoogle Scholar
  7. [7]
    Van P C, Oorschot O, Wiener M J. On Diffie-Hellman Key Agreement with Short Exponents [J].Advances in Cryptology, 1996,1070:332–343.Google Scholar
  8. [8]
    Goldwasser S, Micali S, Rackoff C. The Knowledge Complexity of Interactive Proof Systems [C]//Proc of the 17th STOC. New York: ACM Press, 1985:291–304.Google Scholar
  9. [9]
    Kocher P, Cryptanalysys of Diffie Hellman, RSA, DSS, and Other Cryptosystems Using Timing Attacks [EB/OL]. [2005-09-07].http://wwwi4. informatik. rwth-aachen. de/content/teaching/lectures/sub/sikon/sikonWS0203/pdf/ timing.pdf.Google Scholar
  10. [10]
    Chaum D. Blind Signatures for Untraceable Playments [C]//Advances in Cryptology: Proceedings of Crypto 82. New York: Plenum Press, 1982:199–203.Google Scholar

Copyright information

© Springer 2006

Authors and Affiliations

  1. 1.School of ComputerChongqing UniversityChongqingChina

Personalised recommendations