The variable-interval arithmetic coding using asymptotic deterministic randomness for data compression and encryption

Different from the traditional way which compresses the data first and then encrypts the compressed bit-stream later, a novel compression and encryption scheme using variable model arithmetic coding and coupled chaotic system can encrypt and compress the input plaintext synchronously. However, there will be a compromise between the amount of compression achieved and the amount of security incorporated, because the compression efficiency is determined by the key bit-stream. In this paper, an improved scheme using variable-interval arithmetic coding and asymptotic deterministic randomness has been proposed. The improved scheme is secure because the key bit-stream generated by the asymptotic deterministic randomness can resist previous attacks against chaotic encryption. In addition, the compression efficiency will not change with the key bit-stream, because the statistical model will no longer be changed. The results show that the new scheme can achieve high security and compression efficiency.

[1]  Xiaogang Wu,et al.  Parameter estimation only from the symbolic sequences generated by chaos system , 2004 .

[2]  Wenjiang Pei,et al.  Symbolic dynamics approach to parameter estimation without initial value , 2009 .

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

[4]  James M. Hogan,et al.  Data security in a fixed-model arithmetic coding compression algorithm , 1992, Comput. Secur..

[5]  Ranjan Bose,et al.  A novel compression and encryption scheme using variable model arithmetic coding and coupled chaotic system , 2006, IEEE Transactions on Circuits and Systems I: Regular Papers.

[6]  Frank Rubin,et al.  Arithmetic stream coding using fixed precision registers , 1979, IEEE Trans. Inf. Theory.

[7]  L. Kocarev,et al.  Chaos-based random number generators. Part II: practical realization , 2001 .

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

[9]  Wenjiang Pei,et al.  The asymptotic deterministic randomness , 2007 .

[10]  Fu Sheng.  Chaos-Based Random Number Generators , 2004 .

[11]  G. Álvarez,et al.  Cryptanalysis of an ergodic chaotic cipher , 2003 .

[12]  L. Kocarev,et al.  Chaos-based random number generators-part I: analysis [cryptography] , 2001 .

[13]  M. Baptista.  Cryptography with chaos , 1998 .

[14]  Kai Wang,et al.  Discrete asymptotic deterministic randomness for the generation of pseudorandom bits , 2009 .

[15]  Ian H. Witten,et al.  Arithmetic coding for data compression , 1987, CACM.

[16]  Ahmed H. Tewfik,et al.  Arithmetic coding with dual symbol sets and its performance analysis , 1999, IEEE Trans. Image Process..

[17]  Shawmin Lei.  Efficient multiplication-free arithmetic codes , 1995, IEEE Trans. Commun..

[18]  Guanrong Chen,et al.  A multiple pseudorandom-bit generator based on a spatiotemporal chaotic map , 2006 .

[19]  G. Gibbons,et al.  Stringy cosmic strings with horizons , 1990 .

[20]  Wenjiang Pei,et al.  Pseudo-random number generator based on asymptotic deterministic randomness , 2007, 0710.1908.

[21]  Michael G. Strintzis,et al.  A context based adaptive arithmetic coding technique for lossless image compression , 1999, IEEE Signal Processing Letters.

[22]  Glen G. Langdon,et al.  A simple general binary source code , 1982, IEEE Trans. Inf. Theory.

[23]  M.-H. Hsieh,et al.  Adaptive multialphabet arithmetic coding for video compression , 1999 .

[24]  Kai Wang,et al.  Symbolic Vector Dynamics Approach to Initial Condition and Control Parameters Estimation of Coupled Map Lattices , 2008, IEEE Transactions on Circuits and Systems I: Regular Papers.