论文部分内容阅读
We determined the linear complexity of a family of p2-periodic binary threshold sequences and a family of p2-periodic binary sequences constructed using the Legendre symbol,both of which are derived from Fermat quotients modulo an odd prime p.If 2 is a primitive element modulo p2,the linear complexity equals to p2-p or p2-1,which is very close to the period and it is large enough for cryptographic purpose.