An Efficient Secure Routing and Hierarchical Approach to Elliptic Curve Cryptography Combined with Distributed Group Key Management

Abstract

Applications for such groupings are numerous, as is the need for reliable and secure internal communication. To ensure multicast application security, a group key must be updated each time a member joins or departs the group. Approximately ten years ago, many effective management techniques were implemented to reduce computer overheads. They had not, however, been able to improve the efficiency of rekeying. Elliptic Curve Cryptography for Effective Group Key Management (ECC) is offered for efficient and group communication that is secure in dynamic multicast groups. This strategy creates a hierarchical arrangement among group members. The key server uses each group's position within the hierarchy private key to create a public key. In this research, we will describe a method for managing group keys that is dispersed and hierarchicalsecures the creation and distribution of group keys using elliptic curve cryptography and the hash function. These freshly obtained public keys are used the creation of a shared group key. The key server then provides a group member with the group key and the private key's inverse value. The group key is updated when a new member joins, and the subgroup members are informed of the modified keys. The main server also updates the other group members of the inverse value of the departing member. As a result, this process will make rekeying less computationally demanding. The suggested method reduces computing overhead and communication overhead according to simulation results.