3
$\begingroup$

How was the constant matrix in AES MixColumns constructed?

\begin{bmatrix} 02 & 03 & 01 & 01 \\ 01 & 02 & 03 & 01 \\ 01 & 01 & 02 & 03 \\ 03 & 01 & 01 & 02 \\ \end{bmatrix}

How can I construct in $GF(2^4)$ an invertible matrix for the MixColumns step?

$\endgroup$
3
  • $\begingroup$ how was it constructed? with a circulant matrix containing the smallest possible values to get the job done $\endgroup$ Commented Jun 16, 2016 at 20:33
  • $\begingroup$ There's an entire book (230 pages) about the design of AES, it's called: "The Design of Rijndael: AES – The Advanced Encryption Standard.", chances are the answer is in there somewhere... $\endgroup$
    – SEJPM
    Commented Jun 16, 2016 at 21:51
  • 2
    $\begingroup$ Read at least the Rinjdael submission, section 7.3 $\endgroup$
    – fgrieu
    Commented Jun 16, 2016 at 22:02

1 Answer 1

3
$\begingroup$

Any full rank $n \times n$ circulant matrix $A$ with all entries nonzero generates an MDS code. The entries here were picked for efficient fast multiplication, as far as I can recall.

Do refer to the book suggested by @SEJPM for more.

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.