198 research outputs found
A Non-adaptive Partial Encryption of Grayscale Images based on Chaos
AbstractResearch papers published in recent times have focused towards different kinds of image encryption techniques. Image encryption based on Chaos became very popular for cryptography since properties of Chaos are related to two basic properties of good cipher-Confusion and Diffusion. In this paper, A Non-adaptive Partial Encryption of Grayscale Images Based on Chaoshas been proposed. In Partial encryption speed and time is the main factor. We decompose the original grayscale image into its corresponding binary eight bit planes then encrypted using couple tent map based pseudorandom binary number generator (PRBNG). The four significant bit planes, determined by 5% level of significance on contribution of a bit-plane in determination of a pixel value, are encrypted using keys which are obtained by applying the recurrence relation of tent map based PRBNG. Then the four insignificant bit planes along with encrypted significant bit planes are combined to form the final cipher image. In order to evaluate performance, the proposed algorithm was measured through a series of tests to measure the security and effectiveness of the proposed algorithm. These tests includes visual test through histogram analysis, measures of central tendency and dispersion, correlation-coefficient analysis, key sensitivity test, key space analysis, information entropy test, Measurement of Encryption Quality – MSE, PSNR, NPCR, UACI. Experimental results show that the new cipher has satisfactory security and efficient
A novel image encryption scheme based on Kepler’s third law and random Hadamard transform
In this paper, a novel image encryption scheme based on Kepler’s third law and random Hadamard transform is proposed to ensure the security of a digital image. First, a set of Kepler periodic sequences is generated to permutate image data, which is characteristic of the plain-image and the Kepler’s third law. Then, a random Hadamard matrix is constructed by combining the standard Hadamard matrix with the hyper-Chen chaotic system, which is used to further scramble the image coefficients when the image is transformed through random Hadamard transform. In the end, the permuted image presents interweaving diffusion based on two special matrices, which are constructed by Kepler periodic sequence and chaos system. The experimental results and performance analysis show that the proposed encrypted scheme is highly sensitive to the plain-image and external keys, and has a high security and speed, which are very suitable for secure real-time communication of image data
SRSS: A New Chaos-Based Single-Round Single S-Box Image Encryption Scheme for Highly Auto-Correlated Data
With the advent of digital communication, securing digital images during
transmission and storage has become a critical concern. The traditional s-box
substitution methods often fail to effectively conceal the information within
highly auto-correlated regions of an image. This paper addresses the security
issues presented by three prevalent S-box substitution methods, i.e., single
S-box, multiple S-boxes, and multiple rounds with multiple S-boxes, especially
when handling images with highly auto-correlated pixels. To resolve the
addressed security issues, this paper proposes a new scheme SRSS-the Single
Round Single S-Box encryption scheme. SRSS uses a single S-box for substitution
in just one round to break the pixel correlations and encrypt the plaintext
image effectively. Additionally, this paper introduces a new Chaos-based Random
Operation Selection System-CROSS, which nullifies the requirement for multiple
S-boxes, thus reducing the encryption scheme's complexity. By randomly
selecting the operation to be performed on each pixel, driven by a chaotic
sequence, the proposed scheme effectively scrambles even high auto-correlation
areas. When compared to the substitution methods mentioned above, the proposed
encryption scheme exhibited exceptionally well in just a single round with a
single S-box. The close-to-ideal statistical security analysis results, i.e.,
an entropy of 7.89 and a correlation coefficient of 0.007, validate the
effectiveness of the proposed scheme. This research offers an innovative path
forward for securing images in applications requiring low computational
complexity and fast encryption and decryption speeds.Comment: 6 Page
CellSecure: Securing Image Data in Industrial Internet-of-Things via Cellular Automata and Chaos-Based Encryption
In the era of Industrial IoT (IIoT) and Industry 4.0, ensuring secure data
transmission has become a critical concern. Among other data types, images are
widely transmitted and utilized across various IIoT applications, ranging from
sensor-generated visual data and real-time remote monitoring to quality control
in production lines. The encryption of these images is essential for
maintaining operational integrity, data confidentiality, and seamless
integration with analytics platforms. This paper addresses these critical
concerns by proposing a robust image encryption algorithm tailored for IIoT and
Cyber-Physical Systems (CPS). The algorithm combines Rule-30 cellular automata
with chaotic scrambling and substitution. The Rule 30 cellular automata serves
as an efficient mechanism for generating pseudo-random sequences that enable
fast encryption and decryption cycles suitable for real-time sensor data in
industrial settings. Most importantly, it induces non-linearity in the
encryption algorithm. Furthermore, to increase the chaotic range and keyspace
of the algorithm, which is vital for security in distributed industrial
networks, a hybrid chaotic map, i.e., logistic-sine map is utilized. Extensive
security analysis has been carried out to validate the efficacy of the proposed
algorithm. Results indicate that our algorithm achieves close-to-ideal values,
with an entropy of 7.99 and a correlation of 0.002. This enhances the
algorithm's resilience against potential cyber-attacks in the industrial
domain
Entropy in Image Analysis II
Image analysis is a fundamental task for any application where extracting information from images is required. The analysis requires highly sophisticated numerical and analytical methods, particularly for those applications in medicine, security, and other fields where the results of the processing consist of data of vital importance. This fact is evident from all the articles composing the Special Issue "Entropy in Image Analysis II", in which the authors used widely tested methods to verify their results. In the process of reading the present volume, the reader will appreciate the richness of their methods and applications, in particular for medical imaging and image security, and a remarkable cross-fertilization among the proposed research areas
Noise-Crypt: Image Encryption with Non-linear Noise, Hybrid Chaotic Maps, and Hashing
To secure the digital images over insecure transmission channels, a new image
encryption algorithm Noise-Crypt is proposed in this paper. Noise-Crypt
integrates non-linear random noise, hybrid chaotic maps, and SHA-256 hashing
algorithm. The utilized hybrid chaotic maps are the logistic-tent and the
logistic-sine-cosine map. The hybrid chaotic maps enhance the pseudorandom
sequence generation and selection of substitution boxes, while the
logistic-sine-cosine map induces non-linearity in the algorithm through random
noise. This deliberate inclusion of noise contributes to increased resistance
against cryptanalysis. The proposed scheme has been evaluated for several
security parameters, such as differential attacks, entropy, correlation, etc.
Extensive evaluation demonstrates the efficacy of the proposed scheme, with
almost ideal values of entropy of 7.99 and correlation of -0.0040. Results of
the security analysis validate the potency of the proposed scheme in achieving
robust image encryption
Entropy in Image Analysis III
Image analysis can be applied to rich and assorted scenarios; therefore, the aim of this recent research field is not only to mimic the human vision system. Image analysis is the main methods that computers are using today, and there is body of knowledge that they will be able to manage in a totally unsupervised manner in future, thanks to their artificial intelligence. The articles published in the book clearly show such a future
Security Analysis of a Color Image Encryption Scheme Based on a Fractional‑Order Hyperchaotic System
In 2022, Hosny et al. introduce an image encryption scheme that employs a fractional-order chaotic system. Their approach uses the hyper-chaotic system to generate the system\u27s main parameter, namely a secret permutation which is dependent on the size and the sum of the pixels of the source image. According to the authors, their scheme offers adequate security (i.e. bits) for transmitting color images over unsecured channels. Nevertheless, in this paper we show that the scheme\u27s security is independent on the secret parameters used to initialize the hyper-chaotic system. More precisely, we provide a brute-force attack whose complexity is and needs oracle queries, where and are the width and the height of the encrypted image. For example, for an image of size ( megapixels image) we obtain a security margin of bits, which is six times lower than the claimed bound. To achieve this result, we present two cryptanalytic attacks, namely a chosen plaintext attack and a chosen ciphertext attack
- …