https://doi.org/10.1140/epjs/s11734-023-00993-4
Regular Article
An improved key expansion algorithm based on a 2D discrete hyper chaotic map with memristor
School of Mathematical Sciences, University of Jinan, 250022, Jinan, Shandong, China
Received:
2
March
2023
Accepted:
9
September
2023
Published online:
25
September
2023
Key expansion plays an important role in symmetric block cipher. To generate desired number of round keys that satisfy irreversibility, parallelism and independence, we first constructed a 2D memristor-based discrete hyper chaotic map (2D-MDHCM), through adding a memristor to the 2D discrete hyper chaotic map (2D-DHCM), whose state point has ergodicity in phase space and good randomness in a sufficiently large parameter range. Took advantage of the irreversibility of the chaotic iteration, we designed an irreversible key expansion algorithm, which can generate the round keys in parallel with specified round and flexible length, what’s more, each round key can be generated by the initial key independently. Experimental and analysis results demonstrated that the improved key expansion algorithm satisfied irreversibility, parallelism and independence, which enhanced the security of initial key greatly.
Copyright comment Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
© The Author(s), under exclusive licence to EDP Sciences, Springer-Verlag GmbH Germany, part of Springer Nature 2023. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.