Share Email Print

Proceedings Paper

P-recursive sequence and key-dependent multimedia scrambling
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Multimedia scrambling technologies ensure that multimedia content is only used by authorized users by transforming multimedia data into an unintelligible format. This paper introduces a new P-recursive sequence and two multimedia scrambling algorithms based on the P-recursive sequence. The P-recursive sequence is a more generalized sequence which can derive many well-known sequences such as the P-Fibonacci sequence, the P-Lucas sequence and P-Gray code. The algorithms can be used to scramble two or three dimensional multimedia data in one step. Electronic signatures, grayscale images and three-color-component images are all examples of 2-D and 3-D multimedia data which can utilize these algorithms. Furthermore, a security key parameter p may be chosen as different or the same values for each dimensional component of the multimedia data. Experiments show that the presented algorithms can scramble multimedia data at different levels of security by partially or fully encrypting multimedia data. They also have been demonstrated in the experiments to show good performance in known-plain text attack and common image attacks such as data loss, Gaussian noise, and Salt Pepper noise. The scrambled multimedia data can be completely reconstructed only by using the correct security keys.

Paper Details

Date Published: 3 April 2008
PDF: 12 pages
Proc. SPIE 6982, Mobile Multimedia/Image Processing, Security, and Applications 2008, 69820H (3 April 2008); doi: 10.1117/12.777744
Show Author Affiliations
Yicong Zhou, Tufts Univ. (United States)
Karen Panetta, Tufts Univ. (United States)
Sos Agaian, The Univ. of Texas at San Antonio (United States)

Published in SPIE Proceedings Vol. 6982:
Mobile Multimedia/Image Processing, Security, and Applications 2008
Sos S. Agaian; Sabah A. Jassim, Editor(s)

© SPIE. Terms of Use
Back to Top