FPGA implementation of multi-chaos-based dynamic sbox for robust cryptosystem

This is the authors' abstract. We don't add key points for this paper.

With the increased use of mobile networks these days, it is important to protect our personal data passing through these unprotected radio channels against AI-facilitated attacks. To offer a high level of data protection, we proposed in this work a dynamic version of the ZUC algorithm designed by the Data Assurance and Communication Security Research Center of the Chinese Academy of Sciences and standardized by the 3GPP (3rd Generation Partnership Project) organization to ensure the LTE (Long Term Evolution of radio networks) confidentiality and integrity. The principle relies on combining two chaotic maps to generate dynamic S-boxes that replace the static S-boxes of the original algorithm ( S 0 and S 1 ). To keep the same performance of the standardized algorithm and eliminate any additional latency, the dynamic S-boxes are generated in parallel during its initialization mode, where the Cipher Key (CK) and the Initialization Vector (IV) are loaded to initialize the internal registers. To improve the randomness of the generated keystream, we bitwise XORed the standard output with a chaotic sequence using a third chaotic map. To test the feasibility and suitability of our proposal for real applications, we performed an FPGA-based implementation using the Xilinx XC7Z020 PYNQ-Z2 platform, then evaluated its resistance to cryptanalysis attacks using the most well-known security tests (keystream distribution, randomness and correlation, key sensitivity, plaintext sensitivity, keyspace complexity, and NIST statistical tests). As expected, the experimental results demonstrated the enhanced security level of the ZUC algorithm and its suitability for new generations of mobile communications.