Attack on Liu/Farrell/Boyd Arithmetic Coding Encryption Scheme
Takeyuki Uehara, Reihaneh Safavi–Naini · 1999
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 2 20 .