AES预防措施是否随机起作用？
Do AES encryptions act randomly?
摘要：
高级加密标准（AES）是目前公认的最重要的分组密码算法。AES的这种高保证是由其对十年广泛密码分析的抵抗力给出的，该密码分析没有显示出任何弱点，甚至没有任何偏离随机排列预期的统计行为。只有简化版本的密码已被破解，但它们通常不被实现。在本文中，我们建立了一个区分攻击的AES，利用一种新的密码嵌入的属性。通过我们的攻击，我们给出了一些统计证据，表明AES- $128$置换集作用于消息空间的方式与作用于同一空间的随机置换集的方式显著不同。虽然我们觉得，更多的计算实验，独立的第三方，以验证我们的统计结果，我们表明，非随机行为是相同的，我们会预测使用我们的嵌入的属性。实际上，嵌入降低了AES轮的非线性，因此AES迭代平均而言倾向于保持在大空间中构造的低秩矩阵的低秩。我们的攻击需要$2^{23}$明文-密文对，并且开销相当于$2^{48}$开销。我们希望我们的攻击也适用于AES- $192$和AES- $256$，初步实验证实。
英文摘要：
The Advanced Encryption Standard (AES) is widely recognized as the most important block cipher in common use nowadays. This high assurance in AES is given by its resistance to ten years of extensive cryptanalysis, that has shown no weakness, not even any deviation from the statistical behaviour expected from a random permutation. Only reduced versions of the ciphers have been broken, but they are not usually implemented. In this paper we build a distinguishing attack on the AES, exploiting the properties of a novel cipher embedding. With our attack we give some statistical evidence that the set of AES-$128$ encryptions acts on the message space in a way significantly different than that of the set of random permutations acting on the same space. While we feel that more computational experiments by independent third parties are needed in order to validate our statistical results, we show that the non-random behaviour is the same as we would predict using the property of our embedding. Indeed, the embedding lowers the nonlinearity of the AES rounds and therefore the AES encryptions tend, on average, to keep low the rank of low-rank matrices constructed in the large space. Our attack needs $2^{23}$ plaintext-ciphertext pairs and costs the equivalent of $2^{48}$ encryptions. We expect our attack to work also for AES-$192$ and AES-$256$, as confirmed by preliminary experiments.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
