A scalable frame scrambling algorithm for video encryption

There are a number of algorithms which provide methods to encrypt parts of video frames to make them unrecognizable or degraded. The proposed scheme treats the video as a sequence of ordered frames and provides an algorithm to break this order of frames by first distributing frames into n frame-sequences and then by internally scrambling these frame-sequences using proper keys. Any of these frame sequences hold just a number of arbitrary frames out of the original video sequence and that too in incorrect order. These scrambled frame-sequences prevent important information like the order of events and can be routed through different network paths for secure video transmission over network. As the individual frames are still unencrypted the scheme is suggested to be applied only on videos requiring low security such as long duration entertainment videos. The scheme is extremely cost efficient as the contents of frames are not altered. The scheme is scalable in terms of the number of frame-sequences are formed. An optional extension of the scheme is also proposed for videos requiring hiding of the frame contents also, by scrambling the selective pixels of frames with any other frame from the same frame-sequence.