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 se...

Full description

Saved in:
Bibliographic Details
Published in:Communications in nonlinear science & numerical simulation Vol. 27; no. 1-3; pp. 22 - 29
Main Authors: Zhang, Yushu, Xiao, Di, Wen, Wenying, Nan, Hai, Su, Moting
Format: Journal Article
Language:English
Published: Elsevier B.V 01.10.2015
Subjects:
Arithmetic coding
Columns (process)
Computer simulation
Digitalized modified logistic map
Exchange
Linear feedback shift register
Linear feedback shift registers
Logistics
Perturbance
Randomized arithmetic coding
Security
Shift
Symbols
Shift
Randomized arithmetic coding
Perturbance
Linear feedback shift register
Digitalized modified logistic map
ISSN:1007-5704, 1878-7274
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:•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), where N is the number of the input symbols.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:1007-5704
1878-7274
DOI:10.1016/j.cnsns.2015.02.025