Research Commons
      • Browse 
        • Communities & Collections
        • Titles
        • Authors
        • By Issue Date
        • Subjects
        • Types
        • Series
      • Help 
        • About
        • Collection Policy
        • OA Mandate Guidelines
        • Guidelines FAQ
        • Contact Us
      • My Account 
        • Sign In
        • Register
      View Item 
      •   Research Commons
      • University of Waikato Research
      • Computing and Mathematical Sciences
      • Computer Science Working Paper Series
      • 1994 Working Papers
      • View Item
      •   Research Commons
      • University of Waikato Research
      • Computing and Mathematical Sciences
      • Computer Science Working Paper Series
      • 1994 Working Papers
      • View Item
      JavaScript is disabled for your browser. Some features of this site may not work without it.

      On the insecurity of arithmetic coding

      Cleary, John G.; Irvine, Sean A.; Rinsma-Melchert, Ingrid
      Thumbnail
      Files
      uow-cs-wp-1994-07.pdf
      1.523Mb
      Find in your library  
      Citation
      Export citation
      Cleary, J., Irvine, S. & Rinsma-Melchert, I. (1994). On the insecurity of arithmetic coding. (Working paper 94/07). Hamilton, New Zealand: University of Waikato, Department of Computer Science.
      Permanent Research Commons link: https://hdl.handle.net/10289/1136
      Abstract
      Arithmetic coding is a technique which converts a given probability distribution into an optimal code and is commonly used in compression schemes. The use of arithmetic coding as an encryption scheme is considered. The simple case of a single binary probability distribution with a fixed (but unknown) probability is considered. We show that for a chosen plaintext attack w+ 2 characters is sufficient to uniquely determine a w-bit probability. For many known plaintexts w+ m+ O(log m) symbols where mis the length of an initial sequence containing just one of (the two possible) symbols is sufficient. It is noted that many extensions to this basic scheme are vulnerable to the same attack provided the arithmetic coder can be repeatedly reset to its initial state. If it cannot be reset then their vulnerability remains an open question.
      Date
      1994-06
      Type
      Working Paper
      Series
      Computer Science Working Papers
      Report No.
      94/07
      Collections
      • 1994 Working Papers [18]
      Show full item record  

      Usage

      Downloads, last 12 months
      99
       
       

      Usage Statistics

      For this itemFor all of Research Commons

      The University of Waikato - Te Whare Wānanga o WaikatoFeedback and RequestsCopyright and Legal Statement