| Presentation | 2011-11-15 On the Insecurity of Randomized Arithmetic Codes Based on Markov Model Liang ZHAO, Takashi NISHIDE, Avishek ADHIKARI, Kyung-Hyune RHEE, Kouichi SAKURAI, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | An improvement of arithmetic coding (AC) has been proposed in the paper (Communications in Nonlinear Science and Numerical Simulation, 16(6), pp: 2554-2562, June, 2011). It can be seen as a typical improved arithmetic coding based on Markov model (ACMM). In the current work, the formal definition and drawbacks of this improved arithmetic coding are investigated at first. Then, the ciphertext-only attack (COA) under the condition that the different pseudorandom bit sequences are used to encrypt different plaintext messages is presented. We prove that ACMM is insecure even if the different pseudorandom bit sequences are used to encrypt each plaintext message. Moreover, when the ACMM is combined with the randomized arithmetic code (RAC) (IEEE Trans. Multimedia, 8(5), pp: 905-917, 2006), we explore the security of this combined encryption scheme under COA. The analysis demonstrates that the ACMM+RAC is also insecure. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | Pseudorandom bit / Indistinguishableness / Ciphertext-only attack / Arithmetic coding |
| Paper # | ISEC2011-61,LOIS2011-55 |
| Date of Issue |
| Conference Information | |
| Committee | ISEC |
|---|---|
| Conference Date | 2011/11/7(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | |
| Vice Chair | |
| Secretary | |
| Assistant | |
| Paper Information | |
| Registration To | Information Security (ISEC) |
|---|---|
| Language | ENG |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | On the Insecurity of Randomized Arithmetic Codes Based on Markov Model |
| Sub Title (in English) | |
| Keyword(1) | Pseudorandom bit |
| Keyword(2) | Indistinguishableness |
| Keyword(3) | Ciphertext-only attack |
| Keyword(4) | Arithmetic coding |
| 1st Author's Name | Liang ZHAO |
| 1st Author's Affiliation | Graduate School of Information Science and Electrical Engineering, Kyushu University() |
| 2nd Author's Name | Takashi NISHIDE |
| 2nd Author's Affiliation | Graduate School of Information Science and Electrical Engineering, Kyushu University |
| 3rd Author's Name | Avishek ADHIKARI |
| 3rd Author's Affiliation | Department of Pure Mathematics, University of Calcutta |
| 4th Author's Name | Kyung-Hyune RHEE |
| 4th Author's Affiliation | Department of IT Convergence Applications Engineering, Pukyong National University |
| 5th Author's Name | Kouichi SAKURAI |
| 5th Author's Affiliation | Graduate School of Information Science and Electrical Engineering, Kyushu University |
| Date | 2011-11-15 |
| Paper # | ISEC2011-61,LOIS2011-55 |
| Volume (vol) | vol.111 |
| Number (no) | 285 |
| Page | pp.pp.- |
| #Pages | 8 |
| Date of Issue | |