英文翻译成中文

The SubBytes step
In the SubBytes step, each byte in the array is updated using an 8-bit substitution box, the Rijndael S-box. This operation provides the non-linearity in the cipher. The S-box used is derived from the multiplicative inverse over GF(28), known to have good non-linearity properties. To avoid attacks based on simple algebraic properties, the S-box is constructed by combining the inverse function with an invertible affine transformation. The S-box is also chosen to avoid any fixed points (and so is a derangement), and also any opposite fixed points.
The ShiftRows step
The ShiftRows step operates on the rows of the state; it cyclically shifts the bytes in each row by a certain offset. For AES, the first row is left unchanged. Each byte of the second row is shifted one to the left. Similarly, the third and fourth rows are shifted by offsets of two and three respectively. For the block of size 128 bits and 192 bits the shifting pattern is the same. In this way, each column of the output state of the ShiftRows step is composed of bytes from each column of the input state. (Rijndael variants with a larger block size have slightly different offsets). In the case of the 256-bit block, the first row is unchanged and the shifting for second, third and fourth row is 1 byte, 3 bytes and 4 bytes respectively - although this change only applies for the Rijndael cipher when used with a 256-bit block, which is not used for AES.
The MixColumns step

In the MixColumns step, the four bytes of each column of the state are combined using an invertible linear transformation. The MixColumns function takes four bytes as input and outputs four bytes, where each input byte affects all four output bytes. Together with ShiftRows, MixColumns provides diffusion in the cipher. Each column is treated as a polynomial over GF(28) and is then multiplied modulo x4 + 1 with a fixed polynomial c(x) = 3x3 + x2 + x + 2. The MixColumns step can also be viewed as a multiplication by a particular MDS matrix in Rijndael's finite field.
This process is described further in the article Rijndael mix columns.
急！！！！

该SubBytes一步
在SubBytes一步，每一个字节数组中使用更新的8位替换框， Rijndael算法S盒。这一行动提供了非线性的密码。在S -盒使用的是来自乘法逆以上的GF （ 28 ） ，已知有良好的非线性特性。为了避免攻击的基础上简单的代数性质， S -盒的构造相结合的反函数的可逆仿射变换。在S -盒也是选择，以避免任何固定点（所以是一个紊乱） ，也任何相反的固定点。
该ShiftRows一步
ShiftRows一步的操作就行的状态;它周期性变化的字节每行有一定抵消。对于AES公司，第一行是保持不变。每个字节的第二行是一个转向左边。同样，第三和第四行的偏移转向两个和三个分别。对于块大小128位和192位的转移模式是相同的。这样，每栏的输出状态ShiftRows步骤组成的字节从每栏的输入状态。 （ Rijndael算法的变种，以较大的块大小都略有不同的偏移） 。对于256位的块中，第一行是不变的转变为第二，第三和第四行是1字节， 3字节， 4字节分别-尽管这一变化仅适用于对R ijndael算法加密时使用2 56位块，这是不用于AES公司。
该MixColumns一步

在MixColumns一步， 4个字节每栏的状态相结合，采用可逆线性变换。 MixColumns职能的需要4个字节的投入和产出的4个字节，每个字节的输入影响到所有4个输出字节。连同ShiftRows ， MixColumns提供扩散的密码。每一列被视为一个多项式以上的GF （ 28 ） ，然后乘以模x4 + 1 ，固定多项式的c （十） = 3x3 + x2 + x的+ 2 。该MixColumns步骤也可以被看作是一个乘法的骨髓增生异常综合征尤其是Rijndael算法矩阵的有限领域。
这个过程中进一步阐述了Rijndael算法混合条列。

海鲜 高棉语风格辣椒和巴泽尔虎虾 虎虾准备在一个红辣椒和大蒜酱 印度支那着香茅老虎虾 虎虾, 轻轻地熟超过一交火, 以特刊着香茅和辣椒酱 烤的明虾与米粉 虎虾以米粉烤的, 芳香草和香料. 清蒸鲈鱼在柠檬汁 清蒸鲈鱼沉浸一奇异和柠檬汁的芳香杂拌儿, 大蒜, 葱, 姜, 芫荽, 罗勒树叶和红辣椒 三滋味 / hǎi xiān gāo mián yǔ fēng gē là jiāo huò bā zé ěr hǔ xiā hǔ xiā zhǔn bèi zài yī gě hóng là jiāo huò dài suàn jiàng yìn duó zhī nuó zhuó xiāng máo lǎo hǔ xiā hǔ xiā , qīng qīng dì shú chāo guō yī jiāo huǒ , yǐ tè kān zhuó xiāng máo huò là jiāo jiàng kǎo dì míng xiā yǔ mǐ 粉 hǔ xiā yǐ mǐ 粉 kǎo dì , fāng xiāng cǎo huò xiāng liào . qīng zhēng lú yú zài níng méng zhī qīng zhēng lú yú chén jìn yī qí yì huò níng méng zhī dì fāng xiāng zá pān ér , dài suàn , cōng , jiāng , yuán sui , luó lēi shù yè huò hóng là jiāo sān zī wèi