Generation of Group Key Using Enhanced One Way Function Tree Group Rekey Protocol

Group communication is the basis for many multimedia and web applications. The group key management is a critical problem in a large dynamic group. All group rekeying protocols incur communication and computation overhead at the group key controller and at the group members. EOFT (enhanced one way function tree) approach uses the CRT tuples of smaller remainders instead of keys of larger bits. EOFT reduces the overall computational and the communication rekeying overhead. This work computes the group key using EOFT with actual numeric values for the keys of the group members. Any computation of the keys is carried out in parallel on their CRT remainders. This work proves that the time complexity of CRT conversion is a negligible one compared to that of the cryptographic functions