Paper 2011/177 Original: eprint.iacr.org/2011/177 ↗
Dynamic MDS Matrices for Substantial Cryptographic Strength
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.
Metadata
- Available format(s)
PDF- Category
- Implementation
- Publication info
- Preprint.
- History
- 2011-04-08: last updated
- 2011-04-08: published
- Short URL
- https://ia.cr/2011/177
- License
- https://creativecommons.org/licenses/by/4.0/
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},
url = {https://eprint.iacr.org/2011/177}
}