A Unified Code

We have proposed a novel scheme based on arithmetic coding, an optimal data compression algorithm in the sense of shortest length coding. Our scheme can provide encryption, data compression, and error detection, all together in a one-pass operation. The key size used is 248 bits. The scheme can resist existing attacks on arithmetic coding encryption algorithms. A general approach to attacking this scheme on data secrecy is difficult. The statistical properties of the scheme are very good and the scheme is easily manageable in software. The compression ratio for this scheme is only 2 % worse than the original arithmetic coding algorithm. As to error detection capabilities, the scheme can detect almost all patterns of errors inserted from the channel, regardless of the error probabilities, and at the same time it can provide both encryption and data compression.

[1]  John G. Cleary,et al.  Integrating error detection into arithmetic coding , 1997, IEEE Trans. Commun..

[2]  Ian H. Witten,et al.  Text Compression , 1990, 125 Problems in Text Algorithms.

[3]  Ian H. Witten,et al.  On the privacy afforded by adaptive text compression , 1988, Comput. Secur..

[4]  Colin Boyd,et al.  Resisting the Bergen-Hogan Attack on Adaptive Arithmetic Coding , 1997, IMACC.

[5]  John G. Cleary,et al.  The subset sum problem and arithmetic coding , 1995 .

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

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

[8]  Colin Boyd,et al.  Cryptography and Coding , 1995, Lecture Notes in Computer Science.

[9]  Torleiv Kløve,et al.  Error detecting codes - general theory and their application in feedback communication systems , 1995, The Kluwer international series in engineering and computer science.

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