Cryptology ePrint Archive: Report 2011/177
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.
Category / Keywords: implementation / Maximum Distance Separable (MDS) matrix, dynamic, random, diffusion, optimal matrix
Publication Info: Short paper at WISA'10. Not included in proceedings.
Date: received 5 Apr 2011
Contact author: yasir at snu ac kr
Available format(s): PDF | BibTeX Citation
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.
Version: 20110408:133658 (All versions of this report)
Short URL: ia.cr/2011/177
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]