Computation And Communication Efficient Chinese Remainder Theorem Based Multi-Party Key Generation Using Modified RSA

Abstract

The group key generation is a cryptographic mechanism, designed to provide a common key for a group, some common challenges to this type of algorithm is based on computation and communication cost. However, the involvement of high computational and communication operations to the algorithms then system with low configuration always faces problem in major time delay. The proposed approach is designed specifically to provide computation and communication efficient algorithm for low configuring systems, without violating the security compared to existing approaches. For making our approach computationally efficient, we replaced modular exponential operation with modular multiplication operation, helpful for low configuration system, making task early. For making our approach communication efficient, we used Chinese remainder theorem based multi-party key generation using modified RSA approach, reduced the message transmission cost. The aim of this approach is generating the common key for the group in less computation and communication cost. The major drawback of this approach is that the computation and communication cost becomes expensive when going for communication within the group because the usage of the modular exponential operation. The approach is secure compared to the existing approach, but expensive in terms of computation cost when communication starts, but the major task is to generate the common key for the group in less computation time for a low configuration system. The proposed approach used the modular multiplication operation in common group key generation and also reduced the threat of the factoring problem as the repetition value increased.