A Multilevel Key Distribution using Pseudo - random Permutations


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 4, No. 10, pp. 2493-2500, Oct. 1997
10.3745/KIPSTE.1997.4.10.2493,   PDF Download:

Abstract

We propose a new key management scheme for multiuser group which is classified as hierarchical structure (sometimes it is called a multilevel security hierarchy) in the symmetric key cryptosystem. The proposed scheme is based on the trapdoor one-way permutations which are generated by the pseudo-random permutation algorithm, and it is avaliable for multilevel hierarchical structure composed of a totally ordered set and a partially ordered set, since it has advantage for time and storage from an implemental point of view. Moreover, we obtain a performance analysis by comparing with the other scheme, and show that the proposed scheme is very efficient for computing time of key generation and memory size of key storage.


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]
K. J. Seog, S. Weon, R. K. Hyune, "A Multilevel Key Distribution using Pseudo - random Permutations," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 4, no. 10, pp. 2493-2500, 1997. DOI: 10.3745/KIPSTE.1997.4.10.2493.

[ACM Style]
Kim Ju Seog, Shin Weon, and Rhee Kyung Hyune. 1997. A Multilevel Key Distribution using Pseudo - random Permutations. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 4, 10, (1997), 2493-2500. DOI: 10.3745/KIPSTE.1997.4.10.2493.