Foundations of Security Week11 Lecture

292 字
1 分钟
Foundations of Security Week11 Lecture

Lecture Outline#

  1. Review of AES encryption structure
  2. ShiftRows transformation in AES
  3. MixColumns transformation in AES
  4. AddRoundKey transformation

Learning Outcomes#

By the end of this lecture, students should be able to:

  1. Describe how rows in the AES state matrix are shifted
  2. Describe how columns are transformed using matrix multiplication
  3. Understand how AES operations are performed in GF(28)GF(2^8)
  4. Perform basic MixColumns calculations using polynomial operations

Advanced Encryption Standard (AES)#

Main Rounds - ShiftRows

It shifts the bytes in each row of the subbytes result to the left by a specific number of positions.

Main Rounds - Mix Columns

  • It transforms each column using matrix multiplication in Galois Field (GF(28)\textcolor{blue}{GF(2^8)}) to ensure that changes to one byte affect all four bytes in the column.
  • This multiplication is not traditional matrix multiplication.
  • Each column of the state matrix (consisting of 4 bytes) is treated as a 4-byte vector and is multiplied by a fixed 4 ×\times 4 matrix
  • This is done in GF(28)GF(2^8) using modulo operations with the irreducible polynomial x8+x4+x3+x+1x^8+x^4+x^3+x+1
Fixed 4 × 4(02030101010203010101020303010102)\begin{array}{c} \text{\textcolor{purple}{Fixed 4 $\times$ 4}} \\[0.6em] \begin{pmatrix} \textcolor{red}{02} & \textcolor{red}{03} & \textcolor{red}{01} & \textcolor{red}{01} \\ \textcolor{red}{01} & \textcolor{red}{02} & \textcolor{red}{03} & \textcolor{red}{01} \\ \textcolor{red}{01} & \textcolor{red}{01} & \textcolor{red}{02} & \textcolor{red}{03} \\ \textcolor{red}{03} & \textcolor{red}{01} & \textcolor{red}{01} & \textcolor{red}{02} \end{pmatrix} \end{array}



  • Convert to binary and Reduce using the irreducible polynomial x8+x4+x3+x+1\textcolor{blue}{x^8+x^4+x^3+x+1}

or

  • Compute for all, cross out and Reduce using the irreducible polynomial x8+x4+x3+x+1\textcolor{blue}{x^8+x^4+x^3+x+1}
(02×FE)(03×7C)(01×6F)(01×63)=r1(02\,\textcolor{purple}{\times}\,\textcolor{green}{FE}) \oplus (03\,\textcolor{purple}{\times}\,\textcolor{green}{7C}) \oplus (01\,\textcolor{purple}{\times}\,\textcolor{green}{6F}) \oplus (01\,\textcolor{purple}{\times}\,\textcolor{green}{63}) = \textcolor{green}{r1}GF(28)x7+x6+x5+x4+x3+x2+x+1\begin{equation} \textcolor{blue}{GF(2^8)} \hspace{1em} x^7+x^6+x^5+x^4+x^3+x^2+x+1 \end{equation}


  • Convert to binary and Reduce using the irreducible polynomial x8+x4+x3+x+1\textcolor{blue}{x^8+x^4+x^3+x+1}
(02×FE)(03×7C)(01×6F)(01×63)=r1(02\,\textcolor{purple}{\times}\,\textcolor{green}{FE}) \oplus (03\,\textcolor{purple}{\times}\,\textcolor{green}{7C}) \oplus (01\,\textcolor{purple}{\times}\,\textcolor{green}{6F}) \oplus (01\,\textcolor{purple}{\times}\,\textcolor{green}{63}) = \textcolor{green}{r1}GF(28)x7+x6+x5+x4+x3+x2+x+1\begin{equation} \textcolor{blue}{GF(2^8)} \hspace{1em} x^7+x^6+x^5+x^4+x^3+x^2+x+1 \end{equation}x8+x6+x5+x4+x2  =  1011110100\colorbox{#FFE8D6}{$x^8 + x^6 + x^5 + x^4 + x^2$} \; \textcolor{purple}{=} \; \colorbox{#FFE8D6}{$1011110100$}x8+x4+x3+x+1  =  1000111011\colorbox{#FFF3CD}{$x^8 + x^4 + x^3 + x + 1$} \; \textcolor{purple}{=} \; \colorbox{#FFF3CD}{$1000111011$}



Main RoundsAddRoundKey


支持与分享

如果这篇文章对你有帮助,欢迎分享给更多人或赞助支持!

赞助
Foundations of Security Week11 Lecture
https://firefly.anka2.top/posts/obu/level5/semester2/fos/week11/lecture/
作者
🐦‍🔥不死鸟Anka
发布于
2026-05-19
许可协议
CC BY-NC-SA 4.0

评论区

Profile Image of the Author
A-n-k-a
Over the Frontier / Into the Front
看这里~
合作翻译官绝赞招募中!
音乐
封面

音乐

暂未播放

0:00 0:00
暂无歌词
分类
标签
站点统计
文章
71
分类
5
标签
19
总字数
682,961
运行时长
0
最后活动
0 天前

文章目录