Abstract
Key expansion is an essential component in block cryptography, which serves the round function. By analyzing key expansion module of AES, it is found that the round-keys are highly correlated, and current round-key can be derived from its previous or the next round-key. To address these weaknesses, first, a 2D exponential chaotic map (2D-ECM) that exhibits ergodicity and superior randomness was constructed. Then, the Lyapunov exponents (LEs) were calculated based on the singular value decomposition (SVD) method. In addition, TestU01 test results showed that the sequences generated by 2D-ECM have better randomness. Further, an enhanced key expansion module was designed utilizing 2D-ECM and primitive polynomial over GF(2n), which has irreversibility and parallelism, and the round-keys are independent of each other. Simulation results and performance analysis demonstrated the effectiveness of the proposed enhanced key expansion module.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.