摘要
Square算法是一个8轮SPN结构的分组密码,它是AES的前身,通过构造一个新的2轮Biclique结构,使得对Square算法攻击的数据复杂度从248个选择密文降到216个选择密文,较现有对全轮Square攻击结果,数据复杂度达最优。
Square is an 8-round substitution-permutation block cipher, and is considered as the pre- decessor of the AES. By constructing a new 2-round biclique structure, data complexity can be reduced from 2^48chosen ciphertexts to 2^16 chosen ciphertexts. Compared with the existing results on the full round attack of Square, data complexity is optimal.
出处
《信息工程大学学报》
2015年第4期394-398,共5页
Journal of Information Engineering University
基金
信息保障技术重点实验室开放基金资助项目(KJ-13-010)
