Attack on Liu/Farrell/Boyd Arithmetic Coding Encryption Scheme

  • Takeyuki Uehara
  • Reihaneh Safavi-Naini
Chapter
Part of the IFIP — The International Federation for Information Processing book series (IFIPAICT, volume 23)

Abstract

Arithmetic coding is an optimal data compression algorithm. Witten and Cleary proposed incorporating security into arithmetic coding. This has been an attractive proposal that could result in less overall processing overhead compared to the traditional method of compression followed by encryption. However a number of attacks on arithmetic coding encryption systems have been published which demonstrate the difficulty of successful combination of the two processes. Recently Liu/Farrell/Boyd proposed a new scheme which claimed to be resistant against all the known attacks. In this paper we study the security of this scheme and show an attack that can recover the plaintext message and whose cost is 220.

Keyword

data compression encryption arithmetic coding 
Download to read the full chapter text

References

  1. [BH93]
    Helen A. Bergen and James M. Hogan. A chosen plaintextGoogle Scholar
  2. [BWC90]
    attack on an adaptive arithmetic coding compression algorithm. Computers and Security, 12 (2): 157–167, 1993.CrossRefGoogle Scholar
  3. [BWC90]
    T. C. Bell, I. H. Witten, and J. G. Cleary. Text Compression. Prentice-Hall, 1990.Google Scholar
  4. ICRM95] Sean A. Irvine, John G. Cleary, and Ingrid Rinsma-Melchert. The subset sum problem and arithmetic codingGoogle Scholar
  5. [Irv95]
    . http://www.cs.waikato.ac.nz/ - sirvine/,Sep 1995.Google Scholar
  6. Sean A. Irvine. Compression and Cryptology. PhD thesisGoogle Scholar
  7. [ITU993]
    School of Computing and Mathematical Sciences, University of Waikato, 1995.Google Scholar
  8. ITU. ITU-T T.81 /ISO/IEC 10918-Google Scholar
  9. 1.
    JPEG standard text (postscript). http://icib.igd.fhg.de/icib/telecom/ccitt/rec_t.81/scan.html,1993.Google Scholar
  10. [LBD97]
    Jen Lim, Colin Boyd, and Ed Dawson. Cryptanalysis of adaptive arithmetic coding encryption schemes. ACISP, pages 216–227, 1997.Google Scholar
  11. [LFB97]
    Xian Liu, Patrick G. Farrell, and Colin Boyd. Resisting the bergen-hogan attack on adaptive arithmetic coding. LNCS1355, Cryptography and Coding, Springer, pages 199–208, Dec 1997.Google Scholar
  12. [USN99]
    Takeyuki Uehara and Reihaneh Safavi-Naini. Attacking and mending arithmetic coding encryption schemes. Australian Computer Science Communications, Springer,21(1):408419, Jan 1999.Google Scholar
  13. [WC88]
    Ian H. Witten and John G. Cleary. On the privacy afforded by adaptive text compression. Computers and Security, 7: 397408, 1988.Google Scholar
  14. [WNC87]
    Ian H. Witten, Radford Neal, and John G. Cleary. The c code that was printed in the COMM ACM 1987 article ftp://ftp.cpsc.ucalgary.ca/pub/projects/ar.cod/,1987.Google Scholar

Copyright information

© Springer Science+Business Media Dordrecht 1999

Authors and Affiliations

  • Takeyuki Uehara
    • 1
  • Reihaneh Safavi-Naini
    • 1
  1. 1.School of Information Technology and Computer ScienceUniversity of WollongongNorthfields Ave WollongongAustralia

Personalised recommendations