We propose two types of key management systems that use complementary exponential calculation, in which users in the system divide into groups, and the different modulus numbers are assigned to each group and edges between groups. Key generation information over the modulus numbers is issued to a user by a trusted center. The user who receives the information can generate shared encryption keys between users in the system without using key exchange protocol. In our proposed system, the number of primes is one of the parameters for generating key generation information. The number decreases in inverse proportion to the square of the number of groups compared to the original method. Our proposed technique enabled us to extend the number of users in the system to more than one million, which is not possible with the original method.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Naoya TORII, Takayuki HASEBE, Ryota AKIYAMA, "Extended Key Management System Using Complementary Exponential Calculation" in IEICE TRANSACTIONS on Fundamentals,
vol. E76-A, no. 1, pp. 78-87, January 1993, doi: .
Abstract: We propose two types of key management systems that use complementary exponential calculation, in which users in the system divide into groups, and the different modulus numbers are assigned to each group and edges between groups. Key generation information over the modulus numbers is issued to a user by a trusted center. The user who receives the information can generate shared encryption keys between users in the system without using key exchange protocol. In our proposed system, the number of primes is one of the parameters for generating key generation information. The number decreases in inverse proportion to the square of the number of groups compared to the original method. Our proposed technique enabled us to extend the number of users in the system to more than one million, which is not possible with the original method.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e76-a_1_78/_p
Copy
@ARTICLE{e76-a_1_78,
author={Naoya TORII, Takayuki HASEBE, Ryota AKIYAMA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Extended Key Management System Using Complementary Exponential Calculation},
year={1993},
volume={E76-A},
number={1},
pages={78-87},
abstract={We propose two types of key management systems that use complementary exponential calculation, in which users in the system divide into groups, and the different modulus numbers are assigned to each group and edges between groups. Key generation information over the modulus numbers is issued to a user by a trusted center. The user who receives the information can generate shared encryption keys between users in the system without using key exchange protocol. In our proposed system, the number of primes is one of the parameters for generating key generation information. The number decreases in inverse proportion to the square of the number of groups compared to the original method. Our proposed technique enabled us to extend the number of users in the system to more than one million, which is not possible with the original method.},
keywords={},
doi={},
ISSN={},
month={January},}
Copy
TY - JOUR
TI - Extended Key Management System Using Complementary Exponential Calculation
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 78
EP - 87
AU - Naoya TORII
AU - Takayuki HASEBE
AU - Ryota AKIYAMA
PY - 1993
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E76-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 1993
AB - We propose two types of key management systems that use complementary exponential calculation, in which users in the system divide into groups, and the different modulus numbers are assigned to each group and edges between groups. Key generation information over the modulus numbers is issued to a user by a trusted center. The user who receives the information can generate shared encryption keys between users in the system without using key exchange protocol. In our proposed system, the number of primes is one of the parameters for generating key generation information. The number decreases in inverse proportion to the square of the number of groups compared to the original method. Our proposed technique enabled us to extend the number of users in the system to more than one million, which is not possible with the original method.
ER -