logo

SCIENCE CHINA Information Sciences, Volume 63 , Issue 9 : 199101(2020) https://doi.org/10.1007/s11432-019-2665-5

On the -error linear complexity of $2{p^2}$-periodic binary sequences

More info
  • ReceivedJun 12, 2019
  • AcceptedSep 24, 2019
  • PublishedMar 26, 2020

Abstract

There is no abstract available for this article.


Acknowledgment

Zhihua NIU, Can YUAN and Tao ZHANG were partially supported by State Key Program of National Nature Science Foundation of China (Grant No. 61936001), National Nature Science Foundation of Shanghai (Grant Nos. 16ZR1411200, 17ZR1409800, 19ZR1417700), Research and Development Program in Key Areas of Guangdong Province (Grant No. 2018B010113001), and National Nature Science Foundation of China (Grant No. 61572309). Zhixiong CHEN was partially supported by National Natural Science Foundation of China (Grant No. 61772292) and Projects of International Cooperation and Exchanges NSFC-RFBR (Grant No. 61911530130). Xiaoni DU was partially supported by National Natural Science Foundation of China (Grant No. 61772022).


Supplement

Appendixes A–C.


References

[1] Ding C S, Xiao G Z, Shan W J. The Stability Theory of Stream Ciphers. Berlin: Springer-Verlag, 1991. Google Scholar

[2] Cusick T W, Ding C S, Renvall A. Stream Ciphers and Number Theory. Amsterdam: North-Holland Publishing Co., 1998. Google Scholar

[3] Kurosawa K, Sato F, Sakata T. A relationship between linear complexity and k-error linear complexity. IEEE Trans Inform Theor, 2000, 46: 694-698 CrossRef Google Scholar

[4] Wei S M. An efficient algorithm for determining the $k$-error linear complexity of binary sequences with periods $2{p^n}$. Int J Comput Sci Netw Secur, 2008, 8(4): 221--224. Google Scholar

[5] Zhou J Q. On the k-error linear complexity of sequences with period 2p n over GF(q). Des Codes Cryptogr, 2011, 58: 279-296 CrossRef Google Scholar

[6] Ding C S, Helleseth T. New Generalized Cyclotomy and Its Applications. Finite Fields Their Appl, 1998, 4: 140-166 CrossRef Google Scholar

[7] Chen Z X, Niu Z H, Wu C H. On the k-error linear complexity of binary sequences derived from polynomial quotients. Sci China Inf Sci, 2015, 58: 1-15 CrossRef Google Scholar

[8] Chen Z X. Trace representation and linear complexity of binary sequences derived from Fermat quotients. Sci China Inf Sci, 2014, 57: 1-10 CrossRef Google Scholar

[9] Niu Z H, Chen Z X, Du X N. Linear complexity problems of level sequences of Euler quotients and their related binary sequences. Sci China Inf Sci, 2016, 59: 32106 CrossRef Google Scholar

Copyright 2020 Science China Press Co., Ltd. 《中国科学》杂志社有限责任公司 版权所有

京ICP备17057255号       京公网安备11010102003388号