- 期刊
Linear Complexity of a Family of Pseudorandom Discrete Logarithm Threshold Sequences
並列摘要
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.
延伸閱讀
- Cantó, B., Coll, C., & Sánchez, E. (2011). Identifiability for a Class of Discretized Linear Partial Differential Algebraic Equations. Mathematical Problems in Engineering, 2011(), 589-600-136. https://doi.org/10.1155/2011/510519
- Yan, T. J. (2010). New Binary Sequences of Period pq with Low Values of Correlation and Large Linear Complexity. International Journal of Network Security, 10(3), 185-189. https://doi.org/10.6633/IJNS.201005.10(3).03
- Khan, A., Rahmat, G., & Zada, A. (2013). On Uniform Exponential Stability and Exact Admissibility of Discrete Semigroups. International Journal of Differential Equations, 2013(), 34-37. https://doi.org/10.1155/2013/268309
- SHEN, H. L. (2016). An Identity-based Cryptographic Model for Discrete Logarithm Cryptosystems [master's thesis, National Chung Cheng University]. Airiti Library. https://www.airitilibrary.com/Article/Detail?DocID=U0033-2110201614051272
- Liu, H. N., & Gao, J. (2014). A Note on Large Families of Pseudorandom Binary Sequences and Lattices. Journal of Information Science and Engineering, 30(5), 1635-1654. https://doi.org/10.6688/JISE.2014.30.5.19