Discrete chaotic systems based on memristors exhibit excellent dynamical properties and are more straightforward to implement in hardware, making them highly suitable for generating cryptographic keystreams. However, most existing memristor-based chaotic systems rely on a single memristor. This paper introduces a novel discrete chaotic system employing dual memristors, named the 3D memristive cubic map with dual discrete memristors (3D-MCM). The 3D-MCM system demonstrates richer and more intricate dynamical behaviors compared to its single-memristor counterparts, as verified through bifurcation diagrams, Lyapunov exponent spectra, and complexity analyses. Notably, the system exhibits coexisting attractors, substantially enhancing its dynamical complexity. Hardware implementation of the 3D-MCM attractors confirms its feasibility for industrial applications. To illustrate the system’s potential in encryption tasks, this study integrates the quaternary-based permutation and dynamic emanating diffusion (QPDED-IE) scheme for image encryption with the 3D-MCM.Experimental results demonstrate that the QPDED-IE scheme based on the 3D-MCM exhibits strong diffusion and confusion properties, effectively resisting cryptanalytic attacks.
28 August 2025 in IEEE Transactions on Dependable and Secure Computing
Traditional video encryption methods protect video content by encrypting each frame individually. However, in resource-constrained environments, this approach consumes significant computational resources. To overcome this challenge, this paper proposes a novel method called “Encrypt a story (EAS)”, which aims to enhance encryption efficiency by focusing on encrypting specific segments of the video rather than encrypting each frame. The EAS refers to selecting segments in the time dimension of the video that contain important information or key events for encryption. This method leverages video segmentation techniques to focus encryption efforts on continuous key frames, significantly reducing the consumption of computational resources. To address the need for a large number of key streams during the encryption process, this paper proposes a discrete sinusoidal memristive Rulkov neuron map (DSM-RNM). Through attractor analysis, complexity comparison, Lyapunov exponent, and NIST tests, we validated its ability to generate high-performance pseudorandom sequences, which significantly enhances the security of the encryption algorithm. Notably, the DSM-RNM is shown to exhibit a phenomenon of infinitely coexisting attractors. Furthermore, by constructing a digital circuit to capture the attractors of the DSM-RNM, its potential for industrial applications is demonstrated. Evaluation results show that the EAS saves approximately 90% of the time while ensuring security, exhibiting strong practicality and efficiency
10 February 2025 in IEEE Internet of Things Journal
Images are widely used in social networks, necessitating efficient and secure transmission, especially in bandwidth-constrained environments. This paper aims to develop a color image encryption algorithm that enhances security while optimizing computational efficiency. A novel parallel color image encryption algorithm based on the 2D Logistic-Rulkov neuron map (2D-LRNM) is proposed. In this approach, the three channels of the color image are first separated. Cross-channel information interaction is introduced to form three new channels, which are then processed in parallel. During the encryption process of each channel, a block-wise parallel encryption mechanism is applied, ensuring simultaneous encryption of each block. This block-wise strategy effectively leverages parallel computing resources and balances the task load. To meet the demand for a large number of keystreams during encryption, the 2D-LRNM is introduced. It combines the simplicity and chaotic properties of the Logistic map with the multi-timescale dynamics and neurodynamic behaviors of the Rulkov map. By overcoming the dimensional limitations inherent in the single Logistic map, this approach extends the system to a two-dimensional framework, significantly increasing the complexity of chaotic behavior and improving its unpredictability. Experimental results demonstrate that the proposed encryption algorithm achieves high security and reduces computation time by approximately 83.3%.
27 December 2021 in IEEE Transactions on Circuits and Systems for Video Technology
While existing watermarking attack methods can disturb the correct extraction of watermark information, the visual quality of watermarked images will be greatly damaged. Therefore, a concealed attack based on generative adversarial network and perceptual losses for robust watermarking is proposed. First, the watermarked image is utilized as the input of generative networks, and its generating target (i.e. attacked watermarked image) is the original image. Inspired by the U-Net network, the generative networks consist of encoder-decoder architecture with skip connection, which can combine the low-level and high-level information to ensure the imperceptibility of the generated image. Next, to further improve the imperceptibility of the generated image, instead of the loss function based on MSE, a perceptual loss based on feature extraction is introduced. In addition, a discriminative network is also introduced to make the appearance and distribution of generated image similar to those of the original image. The addition of the discriminative network can remove watermark information effectively. Extensive experiments are conducted to verify the feasibility of the proposed concealed attack method. Experimental and analysis results demonstrate that the proposed concealed attack method has better imperceptibility and attack ability in comparison to the existing watermarking attack methods.
An efficient predictor is crucial for high embedding capacity and low image distortion. In this letter, a ridge regression-based high precision error prediction algorithm for reversible data hiding is proposed. The ridge regression is a penalized least-square algorithm, which solves the overfitting problem of the least-square method. Reversible data hiding based on ridge regression predictor minimizes the residual sum of squares between predicted and target pixels subject to the constraint expressed in terms of the L2-norm. Compared to a least-square-based predictor, the ridge regression-based predictor can obtain more small prediction errors, proving that the proposed method has a higher accuracy. In addition, the eight neighbor pixels of the target pixels and their two different combinations are selected as training and support sets, respectively. This selection scheme further improves the prediction accuracy. Experimental results show that the proposed method outperforms state-of-the-art adaptive reversible data hiding in terms of prediction accuracy and embedding performance.
16 January 2023 in IEEE Transactions on Circuits and Systems for Video Technology
An asynchronous updating Boolean network is employed to simulate and analyze the gene expression of a particular tissue or species, revealing the life activity process from a system perspective to reveal the disease mechanism and treat the disease. Therefore, to ensure the safe transmission of the asynchronous updating Boolean network in the network, we designed an asynchronous updating Boolean network encryption algorithm based on chaos (ABNEA). First, a novel 2D chaotic system (2D-FPSM) is designed. This system has better performance than the classical 2D chaotic system. It is very suitable for cryptographic systems to generate key streams. Second, an encoding rule is designed to convert the asynchronous updating Boolean network to a Boolean matrix and propagate it on the network as an image. The receiver and sender jointly save the encoding rule. Last, to protect the safe propagation of the Boolean network matrix on the network, the method of synchronous scrambling-diffusion is adapted to encrypt the Boolean network matrix based on the 2D-FPSM. Simulation experiments and security analysis show that the average correlation of adjacent pixels of ciphertext are 0.0010, -0.0010, -0.0020, and the average information entropy is 7.9984. The ABNEA can complete the encryption tasks of asynchronously updating Boolean networks and exhibits good security characteristics.