Open AccessGroup-Key Generation through Ternary Tree Based Rebuild Algorithm
Author(s) -
V.Srinadh P.V*.,
Nageswara S. V. Rao
Publication year - 2019
Publication title -
international journal of recent technology and engineering
Language(s) - English
Resource type - Journals
ISSN - 2277-3878
DOI - 10.35940/ijrte.c5811.098319
Subject(s) - rekeying , key (lock) , tree (set theory) , computer science , group (periodic table) , joins , theoretical computer science , k ary tree , communication in small groups , tree structure , binary tree , algorithm , mathematics , cryptography , computer security , key management , computer network , combinatorics , programming language , chemistry , organic chemistry
Security plays essential role in any correspondence framework particularly in Group oriented correspondence. In Group oriented correspondence, entire correspondence will occur with the help of one secret key which is called Group Key. This gathering key must be changed at whatever point another part joins into the gathering just as a current part leaves from the gathering; which is known as rekeying. This gathering correspondence can be spoken to utilizing key tree. In case we utilize ternary tree, tallness of the tree will be expanded if the group members are more, so that rekeying activity takes additional time. Rather than ternary tree on the off chance that we use quad tree, so that the tree stature will be less, so that rekeying activity takes less time. So the correspondence will be increasingly secure and quicker. In this paper we are going to implement Ternary tree based Rebuild Algorithm