### Dynamic MDS Matrices for Substantial Cryptographic Strength

Muhammad Yasir Malik and 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.

Note: As this paper was a short paper at the conference, so it was not published in the proceedings. It is allowed to be published somewhere else.

Available format(s)
Category
Implementation
Publication info
Published elsewhere. Short paper at WISA'10. Not included in proceedings.
Keywords
Maximum Distance Separable (MDS) matrixdynamicrandomdiffusionoptimal matrix
Contact author(s)
yasir @ snu ac kr
History
Short URL
https://ia.cr/2011/177

CC BY

BibTeX

@misc{cryptoeprint:2011/177,
author = {Muhammad Yasir Malik and Jong-Seon No},
title = {Dynamic MDS Matrices for Substantial Cryptographic  Strength},
howpublished = {Cryptology ePrint Archive, Paper 2011/177},
year = {2011},
note = {\url{https://eprint.iacr.org/2011/177}},
url = {https://eprint.iacr.org/2011/177}
}

Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.