Abstract
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
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
