摘要
To prove the security of stop-go sequence generator, this paper presents a novel method based on semi-tensor product operation and Boolean networks which can effectively find the cycle and weak key of stop-go sequence generator. This method translates from the relationship of stop-go to the logical expression, and therefore establishes the relationship between stop-go sequence generator and Boolean network. This method also describes all the state ring of the stop-go sequence generator. And then according to the length of each state ring this paper determines the main cycle and weak key of the stop-go sequence generator. The experimental results prove that the method can not only check the security of the stop-go sequence generator but also have high operability.