Linear Complexity of Binary Whiteman Generalized Cyclotomic Sequences of Order 4
In this letter we propose a new Whiteman generalized cyclotomic sequence of order 4. Meanwhile, we determine its linear complexity and minimal polynomial. The results show that this sequence possesses both high linear complexity and optimal balance on 1 s and 0 s, which may be attractive for cryptographic applications.
linear complexity generalized cyclotomic sequences minimal polynomial cryptography