Application Research of Boyer-Moore Algorithm in Cryptography

The arbitrariness and unpredictability of the sequence generated by the key stream generator determine the strength of the stream cipher, the design of the key stream generator becomes the core problem, the linear feedback shift register is generally used as the driving part of the key stream generator. The number of stages of the shortest linear shift register that produces the sequence is an important indicator of the strength of the stream cipher system, called the linear complexity of the sequence. Based on this, this paper applies the Boyer-Moore algorithm to the cryptography problem, and proves the feasibility of using the Boyer-Moore algorithm to obtain the shortest linear shift register and the linear complexity of the sequence, and proves the uniqueness of the shortest linear shift register obtained by the Boyer-Moore algorithm.