中文摘要：

文章对8轮KASUMI算法的中间相遇攻击结果进行了改进。主要通过改变给定密钥集和穷举密钥集，在多重循环的算法中，增加外层循环的计算量，使得减小了最内层循环的计算量。结果将0．25次FI函数的计算从最内层循环移到外层循环中，使得计算量降低了4．1％；同时存储量从2^49块降到了2^42块。

英文摘要：

The meet-in-middle attack on the 8-round KASUMI algorithm is enhanced in this paper. By modifying the given key set and the exhaustive key set, more computation is conducted in outer loops, and hence the computation in the most inner loop is reduced. With 0.25 FI function compu- tation moved from the most inner loop to outer loops, the computation complexity is reduced by 4. 1% , and the memory demand is changed from 2^49 to 2^42.