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

Abstract

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.

Keywords:

• compression scheme
• encryption scheme
• variable-interval arithmetic coding
• asymptotic deterministic randomness

Acknowledgements

This work was supported by the Natural Science Foundation of China under Grants 60472058 and 60975017, and by the Natural Science Foundation of Nantong University, 13040019. The authors would like to thank the reviewers for their valuable suggestions and comments.