MDS matrix

to get instant updates about 'MDS Matrix' on your MyPage. Meet other similar minded people. Its Free!


All Updates

An MDS matrix (Maximum Distance Separable) is a matrix representing a function with certain diffusion properties that have useful applications in cryptography. Technically, an m&times;n matrix A over a finite field K is an MDS matrix if it is the transformation matrixof a linear transformation f(x)=Ax from K<sup>n</sup> to K<sup>m</sup> such that no two different (m+n)-tuples of the form (x,f(x)) coincide in n or more components.Equivalently, the set of all (m+n)-tuples (x,f(x)) is an MDS code, i.e. a linear code that reaches the Singleton bound.

Let <math>tilde A = left(begin_n\ hlineendright)</math> be the matrix obtained by joining the identity matrix Id<sub>n</sub> to A.Then a necessary and sufficient condition for a matrix A to be MDS is that every possible n&times;n submatrix obtained by removing m rows from <math>tilde A</math>is non-singular.

Reed-Solomon codes have the MDS property and are frequently used to obtain the MDS matrices used in cryptographic algorithms.

Serge Vaudenay suggested using MDS matrices in cryptographic primitives to produce what he called multipermutations, not-necessarily linear functions with this same property. These functions have what he called perfect diffusion: changing t of the inputs changes at least m-t+1 of the outputs. He showed how to exploit imperfect diffusion to cryptanalyze functions that are not multipermutations.

MDS matrices are used for diffusion in...
Read More

No feeds found

wait Posting your question. Please wait!...

No updates available.
No messages found
Tell your friends >
about this page
 Create a new Page
for companies, colleges, celebrities or anything you like.Get updates on MyPage.
Create a new Page
 Find your friends
  Find friends on MyPage from