Some Further Results of Pseudorandom Binary Sequences Derived from the Discrete Logarithm in Finite Fields

Vladimir Edemskiy ； Zhixiong Chen ； Sergey Garbar

《International Journal of Network Security》 22卷6期 (2020/11) Pp. 961-965

https://doi.org/10.6633/IJNS.202011_22(6).09

摘要

In this paper, we study the linear complexity of pseudorandom binary sequences of period p^r (an odd prime power) derived from the discrete logarithm in finite fields. We determine the exact values of the linear complexity of the sequences for odd r≥3 and the k-error linear complexity for k ＜ (p - 1)/2. The results extend that of Z. Chen and Q. Wang from an earlier work.

關鍵字

Binary Sequences ； Finite Field ； k-Error Linear Complexity