Security analysis of discrete logarithm based cryptosystems
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 wordsdiscrete logarithm security analysis prime order subgroup secure implementation
CLC numberTP 309
Unable to display preview. Download preview PDF.
- FIPS 186.Digital Signature Standard, Federal Information Processing Standards Publication 186[S]. Washington DC: Department of Commerce/NIST, 1994.Google Scholar
- 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
- 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
- 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
- Chaum D. Blind Signatures for Untraceable Playments [C]//Advances in Cryptology: Proceedings of Crypto 82. New York: Plenum Press, 1982:199–203.Google Scholar