[Resource Topic] 2011/177: Dynamic MDS Matrices for Substantial Cryptographic Strength

Welcome to the resource topic for 2011/177

Title:
Dynamic MDS Matrices for Substantial Cryptographic Strength

Authors: Muhammad Yasir Malik, Jong-Seon No

Abstract:

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.

ePrint: https://eprint.iacr.org/2011/177

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .