Public Key Cryptosystem Based on Jordan Form

Vol. 15, No. 4, pp. 101-105, Aug. 2005
10.13089/JKIISC.2005.15.4.101, Full Text:
Keywords: matrix similarity, modular equation, multiple roots
Abstract

Recently a new public key cryptosystem based on a diagonal matrix has been proposed by Zheng. This system uses eigenvalues as a long-term key and random numbers as session key generators. However, there are a couple of flaws in that system. In this paper, we propose a new algorithm in which those flaws are all fixed. Our scheme is based on modular equations over a composite and uses a matrix of Jordan form. We also analyze the security of it.

Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from December 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]
H. Lee, "Public Key Cryptosystem Based on Jordan Form," Journal of The Korea Institute of Information Security and Cryptology, vol. 15, no. 4, pp. 101-105, 2005. DOI: 10.13089/JKIISC.2005.15.4.101.

[ACM Style]
Hee-Jung Lee. 2005. Public Key Cryptosystem Based on Jordan Form. Journal of The Korea Institute of Information Security and Cryptology, 15, 4, (2005), 101-105. DOI: 10.13089/JKIISC.2005.15.4.101.