Secure Arithmetic Coding Using Interval Splitting

We present a modified approach to arithmetic coding in which the overall length within the range (0, 1) allocated to each symbol is preserved, but the traditional assumption that a single contiguous interval is used for each symbol is removed. A key known to both the encoder and decoder is used to describe where the intervals are "split" prior to encoding each new symbol. The repeated splitting has the effect of both scrambling the intervals and altering their lengths, thereby allowing both encryption and compression to be obtained simultaneously.

[1]  M. G. Pelchat,et al.  Compression of Black-White Images with Arithmetic Coding , 1981 .

[2]  Ajay Luthra,et al.  Overview of the H.264/AVC video coding standard , 2003, IEEE Trans. Circuits Syst. Video Technol..

[3]  James M. Hogan,et al.  A chosen plaintext attack on an adaptive arithmetic coding compression algorithm , 1993, Comput. Secur..

[4]  Zhen Liu,et al.  Mutual information-based analysis of JPEG2000 contexts , 2005, IEEE Transactions on Image Processing.

[5]  Colin Boyd,et al.  A Unified Code , 1999, IMACC.

[6]  Enrico Magli,et al.  Multimedia Selective Encryption by Means of Randomized Arithmetic Coding , 2006, IEEE Transactions on Multimedia.

[7]  Enrico Magli,et al.  Selective encryption of JPEG 2000 images by means of randomized arithmetic coding , 2004, IEEE 6th Workshop on Multimedia Signal Processing, 2004..

[8]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[9]  Gary J. Sullivan,et al.  Rate-constrained coder control and comparison of video coding standards , 2003, IEEE Trans. Circuits Syst. Video Technol..

[10]  John G. Cleary,et al.  On the insecurity of arithmetic coding , 1995, Comput. Secur..