Computation-Efficient Multicast Key Distribution ABSTRACT: Efficient key distribution is a crucial downside for secure group Communications. The Communication and storage complexity of multicast key distribution downside has been studied extensively. In this paper, we have a tendency to propose a new multicast key distribution theme whose computation complexity is significantly reduced. Instead of using standard encryption algorithms, the scheme employs MDS codes, a category of error control codes, to distribute multicast key dynamically. This scheme drastically reduces the computation load of every group member compared to existing schemes using traditional encryption algorithms. Such a theme is desirable for many wireless applications where moveable devices or sensors need to cut back their computation as a lot of as possible because of battery power limitations. Easily combined with any key-tree-based mostly schemes, this scheme provides abundant lower computation complexity whereas maintaining low and balanced Communication complexity and storage complexity for secure dynamic multicast key. Did you like this research project? To get this research project Guidelines, Training and Code... Click Here facebook twitter google+ linkedin stumble pinterest A Precise Termination Condition of the Probabilistic Packet Marking Algorithm Controlling IP Spoofing through Interdomain Packet Filters