Related Experiment Video
Updated: May 11, 2026
11:23
Lensless Fluorescent Microscopy on a Chip
Published on: August 17, 2011
17.6K
A sector fast encryption algorithm for color images based on one-dimensional composite sinusoidal chaos map
Ye Tao1,2,3, Wenhua Cui1,2,3, Shanshan Wang4
1School of Electronic and Information Engineering, University of Science and Technology Liaoning, Anshan, China.
Plos One
|January 24, 2025
Summary
This study introduces a novel color image encryption algorithm using one-dimensional composite sinusoidal chaotic mapping (CSCM) for faster and more efficient security in the big data era. The proposed method significantly enhances encryption speed while maintaining robust security against various attacks.
Area of Science:
- Computer Science
- Information Security
- Applied Mathematics
Background:
- Image security is critical for data transmission and storage.
- Chaos theory-based image encryption algorithms offer enhanced security.
- Existing algorithms face challenges in speed and efficiency for big data.
Purpose of the Study:
- To develop a fast color image encryption algorithm for the big data era.
- To improve the encryption and decryption speed of color images.
- To enhance the overall efficiency and security of image encryption.
Main Methods:
- Proposed a one-dimensional composite sinusoidal chaotic mapping (CSCM) by combining basic chaotic maps with sine operations.
- Selected and validated the best chaotic mappings (LCS and SCS) using Lyapunov exponent and NIST SP 800-22 tests.
- Implemented a parallel encryption process using a fan-shaped diffusion and scrambling technique for improved speed.
Main Results:
- Achieved a significantly improved encryption and decryption speed.
- Demonstrated a large key space (2^192) and high average information entropy (7.9994).
- Exhibited strong security performance with high average NPCR (99.6172) and UACI (33.4646).
Conclusions:
- The proposed CSCM-based algorithm offers a substantial improvement in speed and efficiency for color image encryption.
- The algorithm provides robust security, effectively resisting common attacks like exhaustion, differential, and noise attacks.
- This method is well-suited for securing color images in the big data environment.
Related Concept Videos
01:24Convolution: Math, Graphics, and Discrete Signals
In any LTI (Linear Time-Invariant) system, the convolution of two signals is denoted using a convolution operator, assuming all initial conditions are zero. The convolution integral can be divided into two parts: the zero-input or natural response and the zero-state or forced response, with t0 indicating the initial time.
To simplify the convolution integral, it is assumed that both the input signal and impulse response are zero for negative time values. The graphical convolution process...
To simplify the convolution integral, it is assumed that both the input signal and impulse response are zero for negative time values. The graphical convolution process...
01:17Convolution Properties II
The important convolution properties include width, area, differentiation, and integration properties.
The width property indicates that if the durations of input signals are T1 and T2, then the width of the output response equals the sum of both durations, irrespective of the shapes of the two functions. For instance, convolving two rectangular pulses with durations of 2 seconds and 1 second results in a function with a width of 3 seconds.
The area property asserts that the area under the...
The width property indicates that if the durations of input signals are T1 and T2, then the width of the output response equals the sum of both durations, irrespective of the shapes of the two functions. For instance, convolving two rectangular pulses with durations of 2 seconds and 1 second results in a function with a width of 3 seconds.
The area property asserts that the area under the...
01:21Convergence of Fourier Series
The Fourier series is a powerful mathematical tool for representing periodic signals as an infinite sum of complex exponentials. In practice, this infinite series is truncated to a finite number of terms, yielding a partial sum. This truncation makes the approximation of the signal feasible but introduces certain challenges, particularly near discontinuities, known as the Gibbs phenomenon.
The Gibbs phenomenon refers to the persistent oscillations and overshoots that occur near discontinuities...
The Gibbs phenomenon refers to the persistent oscillations and overshoots that occur near discontinuities...