A Crypto-broadcast System Based on the New Packet Lock of Factorial Number Representation

Abstract

In this paper, a new integrated packet technique is proposed to apply to the encrypted message multi-cast in a network link environment. A sum-up packet lock is rather essential in a message’s transmission for several different intended recipients in a network system, since the processing time in the message multi-delivery could be substantially reduced. The approaches on the packet integrity employed to the cryptobroadcast system in the past years are either based on the foundation of Chinese remainder theorem or T-base number system. Basically, the later method is somewhat superior to the former used in space requirement of packet construction in the worst case. Following the inspiration of T-base construction, a novel factorial number representation to form the packet lock transmission in a crypto-broadcast system is proposed in this paper. Furthermore, a formal estimation to the magnitude of a constructed packet lock W(mlogn) in bit presentation is required, where m is the total number of a group of network recipients and n is the maximal number among the sub-packets collected from the intended recipients.