Highly Influenced

# Linear Complexity of a Family of Pseudorandom Discrete Logarithm Threshold Sequences

@article{Wu2016LinearCO, title={Linear Complexity of a Family of Pseudorandom Discrete Logarithm Threshold Sequences}, author={Chenhuang Wu and Xiaoni Du and Zhengtao Jiang}, journal={I. J. Network Security}, year={2016}, volume={18}, pages={487-492} }

- Published 2016 in I. J. Network Security

We discuss the linear complexity of a family of binary threshold sequence defined by the discrete logarithm of integers modulo a large prime. It is proved that the linear complexity is at least the half of their period and under some special conditions the linear complexity can achieve maximal.