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 t...
详细信息
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.
In this paper, we propose a flexible JPEG2000 image encryption based on arithmetic coding which combines both compression and encryption. Particularly, we randomly add a subinterval to the probability interval in each...
详细信息
ISBN:
(纸本)9781424414468
In this paper, we propose a flexible JPEG2000 image encryption based on arithmetic coding which combines both compression and encryption. Particularly, we randomly add a subinterval to the probability interval in each coding step during the iterative process of arithmetic coder. The range of this subinterval. can be flexibly adjusted depending on the properties of different applied environments. Furthermore, our approach supports backward compatibility so that an encryption-unaware format-compliant player can play the encrypted code stream without any crash. Notably, our algorithm achieves a very simple switch between the standard compression model and our joint model.
Direct encryption for the JPEG2000 code-streams by using a conventional block cipher needs an additional processing time, whereas the joint compression and encryption schemes increase the coding efficiency but with so...
详细信息
ISBN:
(纸本)9783540928911
Direct encryption for the JPEG2000 code-streams by using a conventional block cipher needs an additional processing time, whereas the joint compression and encryption schemes increase the coding efficiency but with some sacrifices in security. In this paper, a Dually Randomized MQ coder (DRMQ) is presented to support both compression and encryption functionalities, and to achieve tradeoff between security and efficiency. The proposed DRMQ coder avoids the permutations of input/output bits to enhance security. It makes use of a dual randomization to provide more protected results. Furthermore, we show that the DRMQ coder can be combined with a format compliant header encryption algorithm to achieve a fast and full protection of JPEG2000 code-streams. The experimental results confirm the efficiency and encryption performance of our scheme.
Making use of the Lebesgue measure preserving property of the piecewise linear chaotic map, a discrete piecewise linear chaotic map is employed to perform the generalized arithmetic coding, which is an optimal entropy...
详细信息
Making use of the Lebesgue measure preserving property of the piecewise linear chaotic map, a discrete piecewise linear chaotic map is employed to perform the generalized arithmetic coding, which is an optimal entropy coding algorithm adopted by international standards. After a number of message symbols have been encoded by the reverse interval mapping, an enlargement on the encoding interval is performed and some codeword bits are exported accordingly. Based on the enlarged encoding interval, the subsequent symbols are encoded with the modified chaotic maps, the lower and upper bounds of which are determined by the final encoding interval of the symbols already encoded. In the decoding process, the message symbols are recovered by iterating the corresponding chaotic map from an appropriate initial value. The encoding interval enlargement is tracked by performing reverse interval mapping on the decoded symbols. More codeword bits are shifted into the register to form the initial value for decoding the subsequent symbols. Simulation results verify that the compression performance of our scheme is very close to the entropy bound and is comparable to traditional finite-precision arithmetic coding. In addition, cryptographic capability can be integrated into our scheme to make it a joint compression and encryption scheme. Its security is enhanced when compared with the existing schemes based on traditional arithmetic coding.
暂无评论