Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bell T., Cleary J., and Witten I.: Text compression, Prentice Hall, 1990.
Bergen H. and Hogan J.: “A chosen plaintext attack on an adaptive arithmetic coding compression algorithm”, Computers and Security, Vol.12, 1993, pp. 157–167.
Boyd C., Clearr J., Irvine S., Rinsma-Melchert I., and Witten I.: “Integrating error detection into arithmetic coding”, IEEE Trans. COM, Vol.45,No.1, 1997, pp.1–3.
Cleary J., Irvine S., and Rinsma-Melchert I.: “On the insecurity of arithmetic coding”, Computers and Security, Vol.14, 1995, pp.167–180.
Crypt-X, Statistical Package Manual, Measuring the Strength of Stream and Block Ciphers. Information Security Research Centre, Queensland University of Technology, 1990.
Irvine S. and Cleary J.: “The subset sum problem and arithmetic coding”, private communication, 1995.
Klove T. and Korzhik V.: Error Detecting Codes, General theory and their application in feedback communication systems, Kluwer Academic Publishers, 1995.
Liu X., Farrell P., and Boyd C.: “Resisting the Bergen-Hogan attack on adaptive arithmetic coding”, LNCS-1355, Cryptography and Coding, Springer, December, 1997, pp.199–208.
Liu X., Farrell P., and Boyd C.: “Arithmetic coding and data integrity”, Proceedings of WCC’99, pp.291–299, Paris, 11th-14th January, 1999.
Liu X. and Farrell P.: “Arithmetic coding with error correction”, Proceedings of PREP’99, pp.330–333, Manchester, 5th-7th January, 1999.
Witten I. and Cleary J.: “On the privacy afforded by adaptive text compression”, Computers and Security, Vol.7, 1988, pp.397–408.
Witten I., Neal R. and Cleary J.: “Arithmetic coding for data compression”, Communications of the ACM, Vol.30,No.6, 1987, pp.520–540.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liu, X., Farrell, P., Boyd, C. (1999). A Unified Code. In: Walker, M. (eds) Cryptography and Coding. Cryptography and Coding 1999. Lecture Notes in Computer Science, vol 1746. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46665-7_9
Download citation
DOI: https://doi.org/10.1007/3-540-46665-7_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66887-9
Online ISBN: 978-3-540-46665-9
eBook Packages: Springer Book Archive