Skip to main content
SpringerLink
Log in

Cryptanalysis of adaptive arithmetic coding encryption schemes

  • Cryptanalysis
  • Conference paper
  • First Online:
Information Security and Privacy (ACISP 1997)

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

Included in the following conference series:

Abstract

This paper investigates the security of arithmetic coding encryption schemes. A classification scheme for arithmetic coding encryption schemes is proposed and a new adaptive brute-force attack is described. Under certain conditions, it is shown that the adaptive brute-force attack is capable of recovering the key. The way in which the arithmetic coding encryption scheme is initialized appears to make a significant difference to the security of the system as a whole. Although there are modes of operation which are resistant to the adaptive brute-force attack, the security of arithmetic coding encryption schemes is not assured. The results are not conclusive, but are biased toward insecurity.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. T. C. Bell, J. G. Cleary, and I. H. Witten. Text Compression. Prentice-Hall, Englewood Cliffs, NJ, 1990.

    Google Scholar 

  2. H. A. Bergen and J. M. Hogan. Data security in a fixed-model arithmetic coding compression algorithm. Computers & Security, 11:445–461, 1992.

    Google Scholar 

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

    Google Scholar 

  4. S. A. Irvine, J. G. Cleary, and I. Rinsma-Melchert. The subset sum problem and arithmetic coding, http://lucy.cs.waikato.ac.nz/~sirvine/, September 1995.

    Google Scholar 

  5. D. W. Jones. Application of splay trees to data compression. Communications of the ACM, 31(8):996–1007, August 1988.

    Article  Google Scholar 

  6. M. Nelson. The Data Compression Book. M&T Books, North America, 1991.

    Google Scholar 

  7. R. N. Williams. Adaptive Data Compression. Kluwer Academic Publishers, Norwell, MA, 1991.

    Google Scholar 

  8. I. H. Witten and J. G. Cleary. On the privacy afforded by adaptive text compression. Computers & Security, 7:397–480, 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Information Security Research Centre School of Data Communications, Queensland University of Technology, 4001, Brisbane, Australia

    Jen Lim, Colin Boyd & Ed Dawson

Authors
  1. Jen Lim
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Colin Boyd
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ed Dawson
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Vijay Varadharajan Josef Pieprzyk Yi Mu

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lim, J., Boyd, C., Dawson, E. (1997). Cryptanalysis of adaptive arithmetic coding encryption schemes. In: Varadharajan, V., Pieprzyk, J., Mu, Y. (eds) Information Security and Privacy. ACISP 1997. Lecture Notes in Computer Science, vol 1270. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0027929

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63232-0

  • Online ISBN: 978-3-540-69237-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation