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

Zhang, Yushu; Xiao, Di; Wen, Wenying; Nan, Hai; Su, Moting

doi:10.1016/j.cnsns.2015.02.025

Cited by 13 publications

(4 citation statements)

References 36 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To prove the lossless property of the proposed image encryption and compression scheme, we used MSE in Equation (23) to evaluate the differences between an original imagef (i, j) and the corresponding reconstructed image f (i, j).…”

Section: Performance Analysis Of Lossless Image Compression and Encryption Schemementioning

confidence: 99%

See 1 more Smart Citation

Joint Lossless Image Compression and Encryption Scheme Based on CALIC and Hyperchaotic System

Zhang

Tong

Wang

et al. 2021

Entropy

View full text Add to dashboard Cite

For efficiency and security of image transmission and storage, the joint image compression and encryption method that performs compression and encryption in a single step is a promising solution due to better security. Moreover, on some important occasions, it is necessary to save images in high quality by lossless compression. Thus, a joint lossless image compression and encryption scheme based on a context-based adaptive lossless image codec (CALIC) and hyperchaotic system is proposed to achieve lossless image encryption and compression simultaneously. Making use of the characteristics of CALIC, four encryption locations are designed to realize joint image compression and encryption: encryption for the predicted values of pixels based on gradient-adjusted prediction (GAP), encryption for the final prediction error, encryption for two lines of pixel values needed by prediction mode and encryption for the entropy coding file. Moreover, a new four-dimensional hyperchaotic system and plaintext-related encryption based on table lookup are all used to enhance the security. The security tests show information entropy, correlation and key sensitivity of the proposed methods reach 7.997, 0.01 and 0.4998, respectively. This indicates that the proposed methods have good security. Meanwhile, compared to original CALIC without security, the proposed methods increase the security and reduce the compression ratio by only 6.3%. The test results indicate that the proposed methods have high security and good lossless compression performance.

show abstract

Section: Performance Analysis Of Lossless Image Compression and Encryption Schemementioning

confidence: 99%

“…Many joint image compression and encryption algorithms have been proposed . Among them, key-controlled operations in entropy coding methods have become a research direction [21][22][23][24][25]. In these methods, encryption is embedded into entropy coding, such as arithmetic coding and Huffman coding.…”

Section: Introductionmentioning

confidence: 99%

Joint Lossless Image Compression and Encryption Scheme Based on CALIC and Hyperchaotic System

Zhang

Tong

Wang

et al. 2021

Entropy

View full text Add to dashboard Cite

show abstract

“…Many engineering applications require the utilization of random numbers, such as in the area of communication, encryption, codification, and modulation [1][2][3].…”

Section: Introductionmentioning

confidence: 99%

From Continuous-Time Chaotic Systems to Pseudo Random Number Generators: Analysis and Generalized Methodology

Micco

Antonelli

Rosso

2021

Entropy

View full text Add to dashboard Cite

The use of chaotic systems in electronics, such as Pseudo-Random Number Generators (PRNGs), is very appealing. Among them, continuous-time ones are used less because, in addition to having strong temporal correlations, they require further computations to obtain the discrete solutions. Here, the time step and discretization method selection are first studied by conducting a detailed analysis of their effect on the systems’ statistical and chaotic behavior. We employ an approach based on interpreting the time step as a parameter of the new “maps”. From our analysis, it follows that to use them as PRNGs, two actions should be achieved (i) to keep the chaotic oscillation and (ii) to destroy the inner and temporal correlations. We then propose a simple methodology to achieve chaos-based PRNGs with good statistical characteristics and high throughput, which can be applied to any continuous-time chaotic system. We analyze the generated sequences by means of quantifiers based on information theory (permutation entropy, permutation complexity, and causal entropy × complexity plane). We show that the proposed PRNG generates sequences that successfully pass Marsaglia Diehard and NIST (National Institute of Standards and Technology) tests. Finally, we show that its hardware implementation requires very few resources.

show abstract

“…In , Xiang et al described a cryptanalysis of revealing the keystream used for exchanging decision. In addition, the interval swapping technique was also applied in a Slepian–Wolf code based on distributed arithmetic coding and in a secure binary AC by means of digitalized modified logistic map and Linear feedback shift register (LFSR) . Unlike RAC, KAC is a modification of AC in which each symbol may correspond to one contiguous interval or two non‐adjacent intervals because of interval splitting .…”

Section: Introductionmentioning

confidence: 99%

Perturbation meets key‐based interval splitting arithmetic coding: security enhancement and chaos generalization

Zhang

Xiao

Wong

et al. 2015

Security Comm Networks

Self Cite

View full text Add to dashboard Cite

Key-based interval splitting arithmetic coding (KAC) possesses both encryption and compression capabilities. However, it possesses vulnerability to chosen-plaintext attack because the attacker can explore the relationship between the key and the codeword to deduce the secret key. In order to resist this attack, we propose to introduce perturbation into KAC. The perturbation-based KAC not only avoids the flaw of KAC that the splitting keys are usually located at the endpoint of certain codeword or at the border of two codewords but also removes the restriction that the keys are only allowed in certain sub-intervals, which result in great convenience to the key scheduler. In addition, based on generalized arithmetic coding using Generalized Luröth Series, we study the phase-space splitting of a chaotic map for generalized KAC and suggest the generalized perturbation-based KAC. This leads to the design of a joint compression and encryption scheme with more powerful cryptographic features.

show abstract

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

Cited by 13 publications

References 36 publications

Joint Lossless Image Compression and Encryption Scheme Based on CALIC and Hyperchaotic System

Joint Lossless Image Compression and Encryption Scheme Based on CALIC and Hyperchaotic System

From Continuous-Time Chaotic Systems to Pseudo Random Number Generators: Analysis and Generalized Methodology

Perturbation meets key‐based interval splitting arithmetic coding: security enhancement and chaos generalization

Contact Info

Product

Resources

About