Browse > Article
http://dx.doi.org/10.3745/KIPSTC.2002.9C.6.799

Security Analysis of Diffie-Hellman based Standard Key Agreement Protocols  

Kim, Kyung-Jin (성균관대학교 정보통신공학부 대학원)
Kim, Sung-Duk (성균관대학교 정보통신공학부 대학원)
Shim, Kyung-Ah (한국정보보호진흥원(KISA) 암호 기술팀)
Won, Dong-Ho (성균관대학교 정보통신공학부)
Publication Information
The KIPS Transactions:PartC / v.9C, no.6, 2002 , pp. 799-808 More about this Journal
Abstract
According to the wide-spread of information transmission system over network, the use of cryptographic system to provide the integrity of transmitted message over network is increasing and the importance of that is emphasized. Because the security of the cryptographic system totally relies on the key, key management is a essential part of cryptographic system. A number of key agreement protocols have been proposed to far, but their rigorous security analysis is still open. In this paper, we analyze the features of Diffie-Hellman based standard key agreement protocols and provide the security analysis of those protocols against several kinds of active attacks.
Keywords
X9.42; Reduction; Active Attack; Active Impersonation; Key-Compromised Impersonation; Forward Secrecy; Known-Key Attack;
Citations & Related Records
연도 인용수 순위
  • Reference
1 IEEE P1363/D13, 'Standard Specifications for Public Key Cryptography,' 1999
2 ANSI X9.63, 'Public Key Cryptography for the financial services industry : key agreement and key transport using elliptic curve cryptography,' 2001
3 W. Diffie, M. E. Hellman, 'New directions in cryptography,' IEEE Trans. Inform. Theory, IT-22, 6, pp.644-654, 1976   DOI
4 RSA Laboratories Technical Note v1.4, 'PKCS #3 : Diffie-Hellman Key Agreement Standard,' 1993
5 ANSI X9.42, 'Agreement of symmetric Key on Using Diffie-Hellman Cryptography,' 2001
6 K. Sakurai and H. Shizuya, 'Relationships among the computational powers of breaking discrete log cryptosystems,' J. Cryptology, Vol.11, pp.29-43, 1998   DOI
7 M. Mambo and H. Shizuya, 'A note on the complexity of breaking Okamoto-Tanaka Id-based key exchange scheme,' IEICE trans. fundamentals, Vol.E82-A, No.1, January. 1999
8 R. A Rueppel and P. C vanOorschot,' Computer communications, Vol.17, No.7, pp.458-465, 1994   DOI   ScienceOn
9 H. Woll, 'Reductions among number theoretic problems,' Information and Computation, Vol.72, pp.167-179, 1987   DOI
10 K. Sakurai and H. Shizuya, 'Relationships among the computational powers of breaking discrete log cryptosystems,' Proc. Eurocrypt'95, LNCS 921, pp.341-355, Springer Verlag, 1995
11 R. E. Neopolitan, Kumarss Niamipour, 'Foundations of Algorithms,' pp.409-444, 1999
12 E.Bach, 'Discrete Logarithms and factoring,' Technical Report UCB/CSD 84/186, University of California, Computer Science Division (EECS), 1984
13 S. J. Kim, M. Mambo et al., 'On the security of the Okamoto-Tanake ID-Based Key Exchange scheme against Active attacks,' IEICE Trans. pp.231-238, January, 2001