Dynamic MDS Matrices for Substantial Cryptographic Strength

Muhammad Yasir Malik, Jong‐Seon No · arXiv (Cornell University) · 2011

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 we present some methods for constructing dynamic (and random) MDS matrices.

Read the paper · More papers on PaperTik