Dynamic MDS Matrices for Substantial Cryptographic Strength

Details Dynamic MDS Matrices for Substantial Cryptographic Strength Dynamic MDS Matrices for Substantial Cryptographic Strength

2011-08-31

arxiv.org/abs/1108.6302v1

Computer Science

Cryptography and Security

Short paper at WISA'10, 2010

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Dynamic MDS Matrices for Substantial Cryptographic Strength does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Dynamic MDS Matrices for Substantial Cryptographic Strength, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dynamic MDS Matrices for Substantial Cryptographic Strength will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-626462