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}
}
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. 
1 Citations
22 References
Similar Papers

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 22 references

Similar Papers

Loading similar papers…