- 期刊
Linear Complexity of Some Binary Interleaved Sequences of Period 4N
並列摘要
It is necessary that the linear complexity of a key stream sequence in a stream cipher system is not less than half of a period. This paper puts forward the linear complexity of a class of binary interleaved sequences with period 4N over the finite field with characteristic 2. Results show that the linear complexity of some of these sequences satisfies the requirements of cryptography.
延伸閱讀
- Wu, C. H., Du, X. N., & Jiang, Z. T. (2016). Linear Complexity of a Family of Pseudorandom Discrete Logarithm Threshold Sequences. International Journal of Network Security, 18(3), 487-492. https://doi.org/10.6633/IJNS.201605.18(3).10
- BABER, J., BAKHTYAR, M., ULLAH, I., REHMAN, M., & KHALID, M. (2017). Effective Compression of Center Symmetric Local Binary Pattern. Mehran University Research Journal of Engineering and Technology, 36(2), 209-224. https://www.airitilibrary.com/Article/Detail?DocID=P20170126001-201704-201705180022-201705180022-209-224
- Shang, J., Xiong, N., Wan, R., & Guo, B. (2015). Texture Classification Using Local Derivative Binary Pattern. 網際網路技術學刊, 16(5), 933-943. https://doi.org/10.6138/JIT.2015.16.5.20150618e
- Meng, R., & Yan, T. (2017). New Constructions of Binary Interleaved Sequences with Low Autocorrelation. International Journal of Network Security, 19(4), 546-550. https://doi.org/10.6633/IJNS.201707.19(4).7
- Niu, Z., & Sang, Y. (2022). On the Linear Complexity of Binary Half-ℓ-Sequences. International Journal of Network Security, 24(3), 444-449. https://doi.org/10.6633/IJNS.202205_24(3).07