Chaotic Pseudo-random Generator Research Articles

Enhanced lightweight encryption algorithm based on chaotic systems

In order to improve security and efficiency, this study presents a novel lightweight encryption technique that makes use of chaotic systems. Our method creatively combines the new chaotic KLEIN_64 algorithm with the Keccak-256 hash function, offering a solid basis for producing initial values essential for causing chaotic maps during the encryption process. After a deep validation with rigorous NIST testing, our chaotic pseudo random generator, LAC, exhibits excellent reliability and cryptographic robustness. Furthermore, the complexity of the cryptographic round function is improved by incorporating a second chaotic pseudo random generator that combines chaotic LFSR and Skew Tent Maps, thereby fortifying security measures.Designed with resource-limited applications in mind, our approach ensures that the cryptosystem remains both lightweight and efficient, meeting the stringent constraints typical of such environments. The practical feasibility and performance of our approach are extensively evaluated through FPGA implementation on the Zybo 7Z010 platform. Our implementation achieves a remarkable throughput of 2.820 Gbps while maintaining optimal resource utilization and efficiency. Extensive experimental results confirm the superior security of our cryptosystem, with correlation tests, entropy measurement, and histogram analysis showcasing robustness against statistical attacks. Moreover, the cryptosystem shows little fluctuation in the Unified Average Changing Intensity (UACI) and Non-Linear Pixel Change Rate (NPCR), confirming its resistance to differential attacks. Overall, our technique advances lightweight cryptography by providing a robust and efficient solution to modern cybersecurity challenges. In particular, our approach is well-suited for applications with limited resources, ensuring that security is maintained without compromising on performance or efficiency, thus fulfilling the needs of modern, constrained environments.

The Probabilistic Image Encryption Algorithm Based on Galois Field GF(257)

Image encryption technology is an essential measure to protect image information from illegal access. A new probabilistic image encryption algorithm with 480-bit external secret key was proposed in this paper. A chaotic pseudo-random generator is employed to produce the equivalent keys. Then the plain image is covered by the equivalent keys under exclusive or operation to obtain a pending sequence. The pending sequence is transformed into a cipher sequence by arithmetic operations based on GF(257). Finally, the cipher sequence is also covered by the equivalent keys to obtain the cipher image. In the transformation, a 1024-bit pseudo-random number sequence is introduced as the base numbers for the power operation to assist the encryption. The proposed image encryption algorithm has the characteristic of probabilistic encryption. Encrypting the same plain image with the same secret key will result in completely different cipher images. Experiments show that the proposed algorithm has the low time complexity (9.67pi/bit) and space complexity (13.07bit/bit), and high sensitivities on the auxiliary sequence (49.94%), secret key (BACI 26.7698% typically), and plain image (BACI 26.7845% typically), and is a preferred image encryption scheme for commercial and personal image information security.

Steganography in color images with random order of pixel selection and encrypted text message embedding

Information security is major concern in modern digital ages, and the outdated algorithms need to be replaced with new ones or to be improved. In this article a new approach for hiding secret text message in color images is presented, combining steganography and cryptography. The location and the order of the image pixels chosen for information embedding are randomly selected using chaotic pseudo-random generator. Encrypting the secret message before embedding is another level of security designed to misguide the attackers in case of analyzing for traces of steganography. Evaluating the proposed stegoalgorithm. The standard statistical and empirical tests are used for randomness tests, key-space analysis, key-sensitivity analysis, visual analysis, histogram analysis, peak signal-to-noise ratio analysis, chi-square analysis, etc. The obtained results are presented and explained in the present article.