A symmetric image encryption algorithm based on mixed linear–nonlinear coupled map lattice

Zhang, Ying-Qian; Wang, Xingyuan

doi:10.1016/j.ins.2014.02.156

Cited by 537 publications

(210 citation statements)

References 35 publications

Supporting

Mentioning

198

Contrasting

Order By: Relevance

“…Leung et al [9] developed a radial-based CML model for signal detection. Zhang and Wang [10] proposed a mixed linear-nonlinear CML model for image encryption. Konishi et al [11] presented a car-following CML model for suppression of traffic congestion.…”

Section: Introductionmentioning

confidence: 99%

Analysis on Invulnerability of Wireless Sensor Network towards Cascading Failures Based on Coupled Map Lattice

Yang

Yao

2018

Complexity

View full text Add to dashboard Cite

Previous research of wireless sensor networks (WSNs) invulnerability mainly focuses on the static topology, while ignoring the cascading process of the network caused by the dynamic changes of load. Therefore, given the realistic features of WSNs, in this paper we research the invulnerability of WSNs with respect to cascading failures based on the coupled map lattice (CML). The invulnerability and the cascading process of four types of network topologies (i.e., random network, small-world network, homogenous scale-free network, and heterogeneous scale-free network) under various attack schemes (i.e., random attack, maxdegree attack, and max-status attack) are investigated, respectively. The simulation results demonstrate that the rise of interference and coupling coefficient will increase the risks of cascading failures. Cascading threshold values and exist, where cascading failures will spread to the entire network when > or > . When facing a random attack or max-status attack, the network with higher heterogeneity tends to have a stronger invulnerability towards cascading failures. Conversely, when facing a max-degree attack, the network with higher uniformity tends to have a better performance. Besides that, we have also proved that the spreading speed of cascading failures is inversely proportional to the average path length of the network and the increase of average degree ⟨ ⟩ can improve the network invulnerability.

show abstract

Section: Introductionmentioning

confidence: 99%

Analysis on Invulnerability of Wireless Sensor Network towards Cascading Failures Based on Coupled Map Lattice

Yang

Yao

2018

Complexity

View full text Add to dashboard Cite

show abstract

“…Previous studies [8,9] proved that 96.7% of the bit values were unchanged using Fridrich's encryption structure. To reduce redundancy and statistical links, many bit-level-based techniques have been proposed [10][11][12][13][14][15][16]. However, these techniques also have some limitations.…”

Section: Introductionmentioning

confidence: 99%

Cryptanalysis and Improvement of Chaos‐Based Image Encryption Scheme with Circular Inter‐Intra‐Pixels Bit‐Level Permutation

Fan

2017

Mathematical Problems in Engineering

View full text Add to dashboard Cite

A novel chaos-based image encryption scheme has been proposed recently. In this scheme, redundancies of the Fridrich's structure were reduced significantly via a new circular inter-intra-pixels bit-level permutation strategy. However, we proved that the original encryption scheme is vulnerable to the known/chosen-plaintext attacks. Both the permutation and diffusion phases have been improved to enhance the security of the original scheme. By shifting each row of the plain image randomly, known-plaintext attacks could be resisted. Furthermore, by appending double crossover diffusion to the end of the original scheme, chosen-plaintext attacks lost their efficacies. Simulation results demonstrated that the improved encryption scheme outperforms the original one.

show abstract

“…Due to the fact, that images may contain private information that may be related to personal interests or financial affairs, the deliberate disclosure of confidential content becomes a critical issue for people and organizations [1]- [4].…”

Section: Introductionmentioning

confidence: 99%

Image Encryption Technique based on the Entropy Value of a Random Block

Al-Husainy¹,

Uliyan²

2017

ijacsa

View full text Add to dashboard Cite

Abstract-The use of digital images in most fields of information technology systems makes these images usually contain confidential information. When these images transmitted via the Internet especially in the Cloud, it becomes necessary to protect these images in a way that ensure putting the confidential information that are contained far away from the attackers. A proposed image encryption technique has been presented in this work. This technique used a secret key that is extracted from the image content itself. Therefore, there is no need to find a secret channel to exchange any key where, sender and receiver authenticate each other with regards to a shared secret key extracted from the image. The technique constructs its secret key that is used to encrypt the image, based on the entropy values of a set of randomly selected blocks from the image itself. Vairous experiments have been conducted to evaluate the strength and performance of the technique. The experimental results shows that the proposed technique can be used effectively in the field of image security to protect and authenticate images.

show abstract

A symmetric image encryption algorithm based on mixed linear–nonlinear coupled map lattice

Cited by 537 publications

References 35 publications

Analysis on Invulnerability of Wireless Sensor Network towards Cascading Failures Based on Coupled Map Lattice

Analysis on Invulnerability of Wireless Sensor Network towards Cascading Failures Based on Coupled Map Lattice

Cryptanalysis and Improvement of Chaos‐Based Image Encryption Scheme with Circular Inter‐Intra‐Pixels Bit‐Level Permutation

Image Encryption Technique based on the Entropy Value of a Random Block

Contact Info

Product

Resources

About