Adaptive chosen-ciphertext attack on secure arithmetic coding
IEEE Transactions on Signal Processing
| Hi-index | 0.00 |
In this paper we consider the problem of resynchronizing simple arithmetic codes. This research lays the groundwork for future analysis of arithmetic codes with high- order context models. In order for the decoder to achieve full resynchronization, the unknown, initial b bits of the code stream must be determined exactly. When the source is approximately i.i.d., the search complexity associated with choosing the correct sequence is at least O (2 b= 2). Therefore, when b is 100 or more, the time complexity required to achieve full resynchronization is prohibitively high.