Skip to main content
SpringerLink
Log in
Book cover

IMA International Conference on Cryptography and Coding

Cryptography and Coding 1997: Crytography and Coding pp 199–208Cite as

Resisting the Bergen-Hogan attack on adaptive arithmetic coding

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1355))

Abstract

Arithmetic coding is an optimal data compression algorithm in terms of entropy. As it is a shortest length coding, it is well recognized that the randomness of the output of arithmetic coding is very good. Based on arithmetic coding, we propose a novel encryption algorithm. The algorithm can resist existing attacks on arithmetic coding encryption algorithms. The statistical properties of the system are very good. General approach to attack this algorithm is difficult. The algorithm is easily programmed. The algorithm on its own is also an effective data compression algorithm. The compression ratio is only 2% worse than the original arithmetic coding algorithm.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bell T., Cleary J. and Witten I.: Text Compression, Prentice Hall, 1990.

    Google Scholar 

  2. Bergen H. and Hogan J.: “Data security in a fixed-model arithmetic coding compression algorithm”, Computers and Security, Vol. 11, 1992, pp.445–461.

    Article  Google Scholar 

  3. Bergen H. and Hogan J.: “A chosen plaintext attack on an adaptive arithmetic coding compression algorithm”, Computers and Security, Vo1.12, 1993, pp.157–167.

    Article  Google Scholar 

  4. Boyd C.: “Enhancing secrecy by data compression: theoretical and practicalaspects”, Proceedings of Eurocrypt'91, LNCS 547, Springar-Verlag, 1991, pp.266–280.

    Google Scholar 

  5. Boyd C., Cleary 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.

    Article  Google Scholar 

  6. Cleary J., Irvine S. and Rinsma-Melchert I.: “On the insecurity of arithmetic coding”, Computers and Security, Vol. 14, 1995, pp. 167–180.

    Article  Google Scholar 

  7. Irvine S. and Cleary J.: “The subset sum problem and arithmetic coding”, private communication, 1995.

    Google Scholar 

  8. Witten I. and Cleary J.: “On the privacy afforded by adaptive text compression”, Computers and Security, Vol.7, 1988, pp.397–408.

    Article  Google Scholar 

  9. WittenI., Neal R. and Cleary J.: “Arithmetic coding for datacompression”, Communications of the ACM, Vol.30, No.6, 1987, pp.520–540.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Communications Research Group, School of Engineering, University of Manchester, M13 9PL, Manchester, UK

    Xian Liu & Patrick G. Farrell

  2. School of Data Communications, Queensland University of Technology, Q4001, Brisbane, Australia

    Colin A. Boyd

Authors
  1. Xian Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Patrick G. Farrell
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Colin A. Boyd
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Michael Darnell

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Liu, X., Farrell, P.G., Boyd, C.A. (1997). Resisting the Bergen-Hogan attack on adaptive arithmetic coding. In: Darnell, M. (eds) Crytography and Coding. Cryptography and Coding 1997. Lecture Notes in Computer Science, vol 1355. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0024465

Download citation

  • DOI: https://doi.org/10.1007/BFb0024465

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63927-5

  • Online ISBN: 978-3-540-69668-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation