Improving block cipher resilience with dynamically generated XOR matrices using the Fisher-Yates shuffle method
摘要
Strengthening block ciphers against cryptanalysis has been a prominent area of study, resulting in numerous strategies to enhance their security. One effective approach involves introducing dynamic components into traditional block cipher designs. These techniques often modify fundamental operations such as substitution and permutation to increase resistance to attacks. This paper presents a novel algorithm for generating dynamic t-bit XOR matrices by leveraging the Fisher-Yates shuffle method combined with a pseudo-random number generator. We show that these dynamic matrices maintain the uniform randomness of independent keys in the ciphertext. Specifically, dynamic 4-bit XOR matrices are incorporated into the AddRoundKey operation of AES, adding an extra layer of variability. The extensive range of potential dynamic XOR matrices significantly increases complexity for cryptanalysts, thereby improving AES's security and making its behavior more unpredictable.