论文部分内容阅读
Camellia是欧洲密码大计划NESSIE的最终获胜者, 首先构造了Camellia的4轮区分器, 然后利用这些区分器和碰撞搜索技术分析Camellia的安全性. 在密钥长度为128比特的情况下, 攻击6轮Camellia的数据复杂度小于210个选择明文, 时间复杂度小于215次加密; 攻击7轮Camellia的数据复杂度小于212个选择明文, 时间复杂度小于254.5次加密; 攻击8轮Camellia的数据复杂度小于213个选择明文, 时间复杂度小于2112.1次加密; 攻击9轮Camellia的数据复杂度小于2113.6个选择明文, 时间复杂度小于2121次加密. 在密钥长度为192/256比特的情况下, 攻击8轮Camellia的数据复杂度小于213个选择明文, 时间复杂度小于2111.1次加密; 攻击9轮Camellia的数据复杂度小于213个选择明文, 时间复杂度小于2175.6次加密; 攻击10轮Camellia的数据复杂度小于214个选择明文, 时间复杂度小于2239.9次加密. 结果显示碰撞攻击是目前对低轮Camellia最有效的攻击方法.
Camellia was the ultimate winner of the European password plan NESSIE, which first constructed Camellia’s 4-wheel divider and then used these discriminators and collision search techniques to analyze Camellia’s security. In the case of a key length of 128 bits, attack 6 The data complexity of Round Camellia is less than 210 selected plaintexts and the time complexity is less than 215 encryptions. The Camellia 7 round attack data complexity is less than 212 choices plaintext, the time complexity is less than 254.5 encryptions. The data complexity of attacking 8 round Camellia Less than 213 choices of plaintext, the time complexity is less than 2112.1 times of encryption; the attack data of 9 rounds of Camellia is less than 2113.6 plaintexts, the time complexity is less than 2121 times.In the case of the key length of 192/256 bits, Eight rounds of Camellia’s data complexity is less than 213 choices of plaintext, the time complexity is less than 2111.1 times of encryption; 9 rounds of Camellia’s data complexity is less than 213 choices of plaintext, the time complexity is less than 2175.6 times; Attack 10 rounds of Camellia’s data complexity Degree less than 214 choices plaintext, the time complexity is less than 2239.9 encryption. The results show that the collision attack is currently low Camellia most effective method of attack.