We propose a new chaotic map combined with delay and cascade, called tent delay-sine cascade with logistic map (TDSCL). Compared with the original one-dimensional simple map, the proposed map has increased initial value sensitivity and internal randomness and a larger chaotic parameter interval. The chaotic sequence generated by TDSCL has pseudo-randomness and is suitable for image encryption. Based on this chaotic map, we propose an image encryption algorithm with a symmetric structure, which can achieve confusion and diffusion at the same time. Simulation results show that after encryption using the proposed algorithm, the entropy of the cipher is extremely close to the ideal value of eight, and the correlation coefficients between the pixels are lower than 0.01, thus the algorithm can resist statistical attacks. Moreover, the number of pixel change rate (NPCR) and the unified average changing intensity (UACI) of the proposed algorithm are very close to the ideal value, which indicates that it can efficiently resist chosen-plain text attack.
Most of the image encryption schemes based on chaos have so far employed symmetric key cryptography, which leads to a situation where the key cannot be transmitted in public channels, thus limiting their extended application. Based on the elliptic curve cryptography (ECC), we proposed a public key image encryption method where the hash value derived from the plain image was encrypted by ECC. Furthermore, during image permutation, a novel algorithm based on different-sized block was proposed. The plain image was firstly divided into five planes according to the amount of information contained in different bits: the combination of the low 4 bits, and other four planes of high 4 bits respectively. Second, for different planes, the corresponding method of block partition was followed by the rule that the higher the bit plane, the smaller the size of the partitioned block as a basic unit for permutation. In the diffusion phase, the used hyperchaotic sequences in permutation were applied to improve the efficiency. Lots of experimental simulations and cryptanalyses were implemented in which the NPCR and UACI are 99.6124% and 33.4600% respectively, which all suggested that it can effectively resist statistical analysis attacks and chosen plaintext attacks.
Adding time delay to nonlinear systems can significantly improve their performance, making it possible to construct image-encryption algorithms with higher security. In this paper, we propose a time-delayed nonlinear combinatorial hyperchaotic map (TD-NCHM) with a wide hyperchaotic interval. Based on TD-NCHM, we develop a fast and secure image-encryption algorithm that includes a plaintext-sensitive key-generation method and a simultaneous row-column shuffling-diffusion encryption process. Plenty of experiments and simulations demonstrate the superiority of the algorithm in terms of efficiency, security, and practical value in secure communications.
Digital images are widely transmitted over untrusted networks, raising severe challenges to the security of confidential and personal data. To address these issues, this paper develops a four-dimensional variable-parameter hyperchaotic system that leverages the advantages of the classical Sine and two-dimensional Logistic chaotic systems. The proposed system not only features a wider parameter range but also exhibits more complex and unpredictable chaotic behavior, as confirmed by multiple rigorous tests. Building upon this system, we design a fast image encryption algorithm that employs a cyclic shift strategy to continuously expand a small-scale random sequence, thereby generating the random numbers required for secure encryption. This approach significantly reduces the overhead associated with random number generation and effectively addresses the challenges posed by large-scale image encryption. Furthermore, to more accurately evaluate the algorithm’s resistance to differential attacks, we introduce improved metrics—namely, BL-NPCR and BL-UACI—which measure the subtle differences between encrypted images at the binary level. Extensive simulation experiments demonstrate that our proposed encryption algorithm outperforms existing methods in both security and efficiency, effectively resisting various attacks and providing a novel technological pathway for efficient image encryption.
With the development of the Internet, malicious URL attacks have shown a complex and changeable situation, and have always been one of the main factors that threaten network security. In order to detect malicious URLs more effectively, a random walk strategy is proposed to improve the Sparrow search algorithm, which is compared and analyzed with the Sparrow search algorithm, the gray wolf optimization algorithm and the whale optimization algorithm. After a benchmark test function experiment, it is verified that the improved sparrow search algorithm has the characteristics of fast convergence speed and high optimization precision. In order to further verify the practicability of the improved algorithm, the optimal solution of the random walk strategy optimization sparrow search algorithm is used as the initial neuron connection weight and threshold information of the BP neural network and applied to the classification of malicious URLs. The results show that the random walk strategy optimization sparrow search algorithm has a certain ability to optimize the BP network, which can improve the classification accuracy of malicious URLs.(Abstract)
1 April 2021 in Journal of Physics: Conference Series
With the rapid development of economy, people have higher and higher requirements for the performance of security system. The traditional access control system based on face recognition based on deep learning has gradually replaced the traditional access control system. This paper mainly describes the concepts of BP neural network and face recognition, and improves and designs a face recognition system. The detection accuracy of the system reaches 97.8%, the false detection rate is 0.8%, and the leakage rate is 0.8% the detection rate is 1.4%, and the accuracy of face recognition is 96.7%, which can well meet the requirements of contemporary face recognition.