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.
KeywordsCompression Ratio Data Compression Forward Error Correct Initial Interval Arithmetic Code
Unable to display preview. Download preview PDF.
- 1.Bell T., Cleary J., and Witten I.: Text compression, Prentice Hall, 1990.Google Scholar
- 5.Crypt-X, Statistical Package Manual, Measuring the Strength of Stream and Block Ciphers. Information Security Research Centre, Queensland University of Technology, 1990.Google Scholar
- 6.Irvine S. and Cleary J.: “The subset sum problem and arithmetic coding”, private communication, 1995.Google Scholar
- 7.Klove T. and Korzhik V.: Error Detecting Codes, General theory and their application in feedback communication systems, Kluwer Academic Publishers, 1995.Google Scholar
- 9.Liu X., Farrell P., and Boyd C.: “Arithmetic coding and data integrity”, Proceedings of WCC’99, pp.291–299, Paris, 11th-14th January, 1999.Google Scholar
- 10.Liu X. and Farrell P.: “Arithmetic coding with error correction”, Proceedings of PREP’99, pp.330–333, Manchester, 5th-7th January, 1999.Google Scholar