Cryptanalysis of randomized arithmetic codes based on markov model

Liang Zhao, Takashi Nishide, Avishek Adhikari, Kyung Hyune Rhee, Kouichi Sakurai

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

An improvement of arithmetic coding based on Markov model () 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 is proposed in the above mentioned paper, it really lacks the formal definition of the. In the current paper, we not only investigate the security analysis of the, but also put forward formal definitions of the 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 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 is combined with the randomized arithmetic code () (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 + is also insecure. Finally, the simulated experimental results show the correctness of all the proposed attacks.

Original languageEnglish
Title of host publicationInformation Security and Cryptology - 7th International Conference, Inscrypt 2011, Revised Selected Papers
Pages341-362
Number of pages22
DOIs
Publication statusPublished - Nov 5 2012
Event7th China International Conference on Information Security and Cryptography, Inscrypt 2011 - Beijing, China
Duration: Nov 30 2011Dec 3 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7537 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other7th China International Conference on Information Security and Cryptography, Inscrypt 2011
CountryChina
CityBeijing
Period11/30/1112/3/11

Fingerprint

Cryptanalysis
Encryption
Markov Model
Cryptography
Attack
Arithmetic Coding
Security Analysis
Multimedia
Correctness
Numerical Simulation
Methodology
Communication
Computer simulation
Experimental Results
Demonstrate

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Zhao, L., Nishide, T., Adhikari, A., Rhee, K. H., & Sakurai, K. (2012). Cryptanalysis of randomized arithmetic codes based on markov model. In Information Security and Cryptology - 7th International Conference, Inscrypt 2011, Revised Selected Papers (pp. 341-362). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7537 LNCS). https://doi.org/10.1007/978-3-642-34704-7-24

Cryptanalysis of randomized arithmetic codes based on markov model. / Zhao, Liang; Nishide, Takashi; Adhikari, Avishek; Rhee, Kyung Hyune; Sakurai, Kouichi.

Information Security and Cryptology - 7th International Conference, Inscrypt 2011, Revised Selected Papers. 2012. p. 341-362 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7537 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Zhao, L, Nishide, T, Adhikari, A, Rhee, KH & Sakurai, K 2012, Cryptanalysis of randomized arithmetic codes based on markov model. in Information Security and Cryptology - 7th International Conference, Inscrypt 2011, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 7537 LNCS, pp. 341-362, 7th China International Conference on Information Security and Cryptography, Inscrypt 2011, Beijing, China, 11/30/11. https://doi.org/10.1007/978-3-642-34704-7-24
Zhao L, Nishide T, Adhikari A, Rhee KH, Sakurai K. Cryptanalysis of randomized arithmetic codes based on markov model. In Information Security and Cryptology - 7th International Conference, Inscrypt 2011, Revised Selected Papers. 2012. p. 341-362. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-34704-7-24
Zhao, Liang ; Nishide, Takashi ; Adhikari, Avishek ; Rhee, Kyung Hyune ; Sakurai, Kouichi. / Cryptanalysis of randomized arithmetic codes based on markov model. Information Security and Cryptology - 7th International Conference, Inscrypt 2011, Revised Selected Papers. 2012. pp. 341-362 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{3f01acfff8c240d982004dcced1884cc,
title = "Cryptanalysis of randomized arithmetic codes based on markov model",
abstract = "An improvement of arithmetic coding based on Markov model () 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 is proposed in the above mentioned paper, it really lacks the formal definition of the. In the current paper, we not only investigate the security analysis of the, but also put forward formal definitions of the 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 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 is combined with the randomized arithmetic code () (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 + is also insecure. Finally, the simulated experimental results show the correctness of all the proposed attacks.",
author = "Liang Zhao and Takashi Nishide and Avishek Adhikari and Rhee, {Kyung Hyune} and Kouichi Sakurai",
year = "2012",
month = "11",
day = "5",
doi = "10.1007/978-3-642-34704-7-24",
language = "English",
isbn = "9783642347030",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "341--362",
booktitle = "Information Security and Cryptology - 7th International Conference, Inscrypt 2011, Revised Selected Papers",

}

TY - GEN

T1 - Cryptanalysis of randomized arithmetic codes based on markov model

AU - Zhao, Liang

AU - Nishide, Takashi

AU - Adhikari, Avishek

AU - Rhee, Kyung Hyune

AU - Sakurai, Kouichi

PY - 2012/11/5

Y1 - 2012/11/5

N2 - An improvement of arithmetic coding based on Markov model () 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 is proposed in the above mentioned paper, it really lacks the formal definition of the. In the current paper, we not only investigate the security analysis of the, but also put forward formal definitions of the 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 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 is combined with the randomized arithmetic code () (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 + is also insecure. Finally, the simulated experimental results show the correctness of all the proposed attacks.

AB - An improvement of arithmetic coding based on Markov model () 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 is proposed in the above mentioned paper, it really lacks the formal definition of the. In the current paper, we not only investigate the security analysis of the, but also put forward formal definitions of the 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 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 is combined with the randomized arithmetic code () (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 + is also insecure. Finally, the simulated experimental results show the correctness of all the proposed attacks.

UR - http://www.scopus.com/inward/record.url?scp=84868157772&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84868157772&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-34704-7-24

DO - 10.1007/978-3-642-34704-7-24

M3 - Conference contribution

SN - 9783642347030

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 341

EP - 362

BT - Information Security and Cryptology - 7th International Conference, Inscrypt 2011, Revised Selected Papers

ER -