Abstract:An initial reconstruction algorithm is given for the generalized self-shrinking sequences using the ideas of the guessing attack. The result shows that: (1) when both the characteristic polynomial of the Linear Feedback Shift Register (LFSR) and the linear combiner are known, the algorithm ensures the cryptanalysis with complexity O((L/2)32L-2)),l≤L/2; (2) when the linear combiner is unknown, the algorithm ensures the cryptanalysis with complexity O(L322L-1),l≤L; (3) When the characteristic polynomial of the LFSR is unknown, the algorithm ensures the cryptanalysis with complexity O(ψ(2L-1)L-122L-l),l≤L. Here L is the length of the LFSR.
董丽华;曾勇;胡予濮. 广义自缩序列的一种比较快速的密码学分析方法[J]. 电子与信息学报, 2004, 26(11): 1783-1786 .
Dong Li-hua①②;Zeng Yong②; Hu Yu-pu①②. A Fast Cryptanalysis of the Generalized Self-shrinking Sequences. , 2004, 26(11): 1783-1786 .