Enhanced lightweight encryption algorithm based on chaotic systems

Abstract

Abstract 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.