Dynamic MDS Matrices for Substantial Cryptographic Strength
Ciphers get their strength from the mathematical functions of confusion and diffusion, also known as substitution and permutation. These were the basics of classical cryptography and they are still the basic part of modern ciphers. In block ciphers diffusion is achieved by the use of Maximum Distance Separable (MDS) matrices. In this paper the authors present some methods for constructing dynamic (and random) non-linear MDS matrices. As defined by Claude Shannon in his paper "Communication Theory of Secrecy Communication", confusion and diffusion are two properties necessitated for the operation of any secure cryptographic algorithm.