Secure binary arithmetic coding based on digitalized modified logistic map and linear feedback shift register

• The proposed arithmetic coding is based on digitalized modified logistic map.
• The security is improved due to the architecture of shift–perturbance.
• The scheme possesses high sensitivity and strong randomness.
• The appended computational complexity is very small.

In this paper, we propose a novel secure arithmetic coding based on digitalized modified logistic map (DMLM) and linear feedback shift register (LFSR). An input binary sequence is first mapped into a table, which is then scrambled by two cyclic shift steps driven by the keys resulting from DMLM–LFSR. Next, each column is encoded using traditional arithmetic coding (TAC) and randomized arithmetic coding (RAC). During the RAC process, the exchange of two intervals is controlled by the keystream generated from the DMLM. At the same time, a few bits of the present column sequence are extracted to interfere the generation of new keystream used for the next column. The final ciphertext sequence is obtained by XORing the compressed sequence and the keystream generated by the LFSR. Results show the compression ratio of our scheme is slightly higher than that of TAC, but the security is improved due to the architecture of shift–perturbance. DMLM and LFSR theories also ensure high sensitivity and strong randomness. The appended complexity is only O(N)O(N), where N is the number of the input symbols.