On the GF(p) linear complexity of legendre sequence
Xianmang He · Journal of Communications · 2008
Linear complexity is an important cryptographic criterion of stream ciphers. The sequences over GF(2) can be considered as sequences over GF(p) (p is a small odd prime number), therefore, their linear complexity needs to be studied over GF(p). From this perspective,the linear complexity of legendre sequence over GF(p) was discussed. Its application on cyclotomic polynomial factoring and some extensions are also covered.