Diffie-Hellman Based Asymmetric Key Exchange Method Using Collision of Exponential Subgroups


KIPS Transactions on Software and Data Engineering, Vol. 9, No. 2, pp. 39-44, Feb. 2020
https://doi.org/10.3745/KTSDE.2020.9.2.39,   PDF Download:
Keywords: Diffie-Hellman, Asymmetric Key Cryptography, Key Exchange
Abstract

In this paper, we show a modified Diffie-Hellman key exchange protocol that can exchange keys by exposing only minimal information using pre-computable session key pairs. The discrete logarithm problem, which provides the safety of existing Diffie-Hellman and Diffie-Hellman based techniques, is modified to prevent exposure of primitive root. We prove the algorithm's operation by applying the actual value to the proposed scheme and compare the execution time and safety with the existing algorithm, shown that the security of the algorithm is improved more than the product of the time complexity of the two base algorithms while maintaining the computation amount at the time of key exchange. Based on the proposed algorithm, it is expected to provide a key exchange environment with improved security.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
J. H. Song, S. Kim, M. Jun, "Diffie-Hellman Based Asymmetric Key Exchange Method Using Collision of Exponential Subgroups," KIPS Transactions on Software and Data Engineering, vol. 9, no. 2, pp. 39-44, 2020. DOI: https://doi.org/10.3745/KTSDE.2020.9.2.39.

[ACM Style]
Jun Ho Song, Sung-Soo Kim, and Moon-Seog Jun. 2020. Diffie-Hellman Based Asymmetric Key Exchange Method Using Collision of Exponential Subgroups. KIPS Transactions on Software and Data Engineering, 9, 2, (2020), 39-44. DOI: https://doi.org/10.3745/KTSDE.2020.9.2.39.