A modified version of Rijndael algorithm implemented to analyze the cyphertexts correlation for switched S-Boxes

There are more than eleven years since Rijndael algorithm was declared the winner of the NIST contest for the new AES election. All this time the original algorithm was analyzed and attacked by cryptanalysts and hackers in order to find its vulnerabilities. The modified version of Rijndael we analyze in this paper randomly changes the accessing order of S-Boxes implemented in the source code of the original algorithm, due to affine transformation and inverse matrix properties. The goal is to obtain two different cyphertexts, keeping the plaintext and the secret key. For this to be possible, a PRNG designed by Gorge Marsaglia was implemented in the software solution.