On the security of binary arithmetic coding based on interval shrinking

摘要

Arithmetic coding (AC) is often chosen for joint compression and encryption. In this paper, we conduct a careful analysis of secure binary AC schemes based on interval shrinking regarding its security. We first give theoretical conditions for our attacks, then under these conditions we are able to recover the plaintext using traditional AC decoder without knowing any shrinking information. The attacks are feasible to uni-shrinking and symmetric bi-shrinking in different AC models. Extensive simulations are carried out and experimental results have validated our theoretical analysis. Effective remedy is also given in the end.