Linear Complexity Of A Class Of Binary Sequence Of Prime Period

—In this paper, we are concerned with stream ciphers, which belongs to symmetric key. It was the main trend in handicraft and mechanical cryptography times. Because of its simple realizing, quick encryption and finite transmitting errors, it always keeps superiority in real application. So stream ciphers is the hot subject in the world.Since the rising of the cryptography, the powerful question of cryptography is popular. The key of question is bring up the new quota. The B-M comprehensive method for LFSR made the linear complexity became a new quota for stream ciphers. In this paper, for a kind of generalized cyclotomic binary sequences with prime period N = 6 f+1, we computer their linear complexity. Specially, any one of the binary sequences has optimum balance among 0's and 1's. The main result of this paper shows that sequences have high linear complexity.