Cryptanalysis of randomized arithmetic codes based on markov model

Authors:
Liang Zhao;Takashi Nishide;Avishek Adhikari;Kyung-Hyune Rhee;Kouichi Sakurai
Affiliations:
Graduate School of Information Science and Electrical Engineering, Kyushu University, Fukuoka, Japan;Graduate School of Information Science and Electrical Engineering, Kyushu University, Fukuoka, Japan;Department of Pure Mathematics, University of Calcutta, Kolkata, India;Department of IT Convergence Applications Engineering, Pukyong National University, Busan, Republic of Korea;Graduate School of Information Science and Electrical Engineering, Kyushu University, Fukuoka, Japan
Venue:
Inscrypt'11 Proceedings of the 7th international conference on Information Security and Cryptology
Year:
2011

Citing 14
Cited 0

On the privacy afforded by adaptive text compression

Computers and Security
Data security in a fixed-model arithmetic coding compression algorithm

Computers and Security
A chosen plaintext attack on an adaptive arithmetic coding compression algorithm

Computers and Security
Cryptanalysis of Adaptive Arithmetic Coding Encryption Schemes

ACISP '97 Proceedings of the Second Australasian Conference on Information Security and Privacy
Attack on Liu/Farrell/Boyd Arithmetic Coding Encryption Scheme

CMS '99 Proceedings of the IFIP TC6/TC11 Joint Working Conference on Secure Information Networks: Communications and Multimedia Security
Resisting the Bergen-Hogan Attack on Adaptive Arithmetic Coding

Proceedings of the 6th IMA International Conference on Cryptography and Coding
Introduction to Modern Cryptography (Chapman & Hall/Crc Cryptography and Network Security Series)

Introduction to Modern Cryptography (Chapman & Hall/Crc Cryptography and Network Security Series)
Adaptive chosen-ciphertext attack on secure arithmetic coding

IEEE Transactions on Signal Processing
On the security of the secure arithmetic code

IEEE Transactions on Information Forensics and Security - Special issue on electronic voting
Secure Arithmetic Coding

IEEE Transactions on Signal Processing
On the Security of Randomized Arithmetic Codes Against Ciphertext-Only Attacks

IEEE Transactions on Information Forensics and Security
Design of integrated multimedia compression and encryption systems

IEEE Transactions on Multimedia
Multimedia Selective Encryption by Means of Randomized Arithmetic Coding

IEEE Transactions on Multimedia
Cryptanalysis of Some Multimedia Encryption Schemes

IEEE Transactions on Multimedia

Quantified Score

Hi-index	0.00

Visualization

Abstract

An improvement of arithmetic coding based on Markov model ($\textsf{ACMM}$) has been proposed in the paper (Duan L.L., Liao X. F., Xiang T., Communications in Nonlinear Science and Numerical Simulation, 2011, 16(6):2554-2562). Though, a methodology to construct the $\textsf{ACMM}$ is proposed in the above mentioned paper, it really lacks the formal definition of the $\textsf{ACMM}$. In the current paper, we not only investigate the security analysis of the $\textsf{ACMM}$, but also put forward formal definitions of the $\textsf{ACMM}$ as well as its different security notions. Based on those definitions, a chosen-plaintext attack is proposed to reveal the used pseudorandom bit sequence for the encryption under the condition that the same pseudorandom bit sequence is used to encrypt the different messages. We also show that the $\textsf{ACMM}$ does not have indistinguishable encryptions under the ciphertext-only attack (i.e., does not have indistinguishable encryptions in the presence of an eavesdropper) even if the different pseudorandom bit sequences are used to encrypt the different messages. Moreover, when the $\textsf{ACMM}$ is combined with the randomized arithmetic code ($\textsf{RAC}$) (Grangetto M., Magli E., Olmo G., IEEE Trans. Multimedia, 2006 8(5):905-917), we also explore the insecurity of this combined encryption scheme. The analysis demonstrates that the $\textsf{ACMM}$ + $\textsf{RAC}$ is also insecure. Finally, the simulated experimental results show the correctness of all the proposed attacks.