A NEW METHOD FOR RESYNCHRONIZATION ATTACK  

作　　者：Chen Jie Wang Baocang Hu Yupu 

机构地区：[1]Key Lab of Computer Networks ＆ lnfo, Security, Ministry of Education, Xidian Univ., Xi＇an 710071, China

出　　处：《Journal of Electronics(China)》2006年第3期423-427,共5页电子科学学刊（英文版）

基　　金：Supported in part by the National Natural Science Foundation of China (No.60273084)the National Laboratory for Modern Communications Foundation of China (No.51436030105DZ0105).

摘　　要：This paper presents a new method for resynchronization attack, which is the combination of the differential cryptanalysis and algebraic attack. By using the new method one gets a system of linear equations or low-degree equations about initial keys, and the solution of the system of equations results in the recovery of the initial keys. This method has a lower computational complexity and better performance of attack in contrast to the known methods. Accordingly, the design of the resynchronization stream generators should be reconsidered to make them strong enough to avoid our attacks. When implemented to the Toyocrypt, our method gains the computational complexity of O（2^17）, and that of 0（2^67） for LILI-128.This paper presents a new method for resynchronization attack, which is the combination of the differential cryptanalysis and algebraic attack. By using the new method one gets a system of linear equations or low-degree equations about initial keys, and the solution of the system of equations results in the recovery of the initial keys. This method has a lower computational complexity and better performance of attack in contrast to the known methods. Accordingly, the design of the resynchronization stream generators should be reconsidered to make them strong enough to avoid our attacks. When implemented to the Toyocrypt, our method gains the computational complexity of O(217), and that of O(267) for LILI-128.

关 键 词：Stream ciphers Resynchronization attack Algebraic attacks Differential cryptanalysis Computational complexity 

分 类 号：TP309[自动化与计算机技术—计算机系统结构]