Design And Implementation Of Multicast Key Distribution Protocol Based On Complete Subtree

With the popularization of informatization and digitalization,multicast technology has developed rapidly.Multicast has the characteristics of saving bandwidth resources,reducing network congestion,and reducing network load.Multicast communication security is an important prerequisite for multicast communication.At present,in multicast communication,how to ensure secure communication and more efficient distribution of group keys for multicast communication has become a hot topic in recent years.The group key is a group key shared by the members in the group.The group key can encrypt the content of the group communication.The creation,distribution,and update of the group key are realized through the group controller(GC).In actual applications,when the user growth rate is too fast,a large number of users flood into the terminal,which will bring a huge load to the server.In order to save costs,some companies often reduce security requirements.Traditional key distribution strategies require more communication resources.The Complete Subset Tree(CS)protocol can effectively reduce key distribution and distribute group keys more efficiently.This paper combines the features of the CS protocol to reduce key distribution and the high security of the RSA cryptographic algorithm.design and implement a stateless group key distribution scheme based on a generic tree structure,To achieve a balance between communication overhead and security.According to the design principles of the multicast key system,this paper proposes the shortcomings of multicast key distribution by introducing the research background and research situation of multicast key distribution.Firstly,the full subtree protocol and the asymmetric encryption-based RSA algorithm are introduced.The encryption algorithm used by this protocol and the basis of the distribution group key are explained.The server initialization process,user entry process,and user eviction are described in detail in this article.Process,to realize the management of user information and the process of key creation and distribution,and the decryption process on the server side,the relationship between the complexity and security of the scheme in this paper is analyzed theoretically.Secondly,the scheme was realized through experiments,and different parameters were selected to test the performance of the scheme.Finally,the feasibility of the scheme is verified from the implementation level,and the balance of performance,storage overhead,computational overhead,and security in the proposed scheme is analyzed through experimental results.