On error linear complexity of new generalized cyclotomic binary sequences of period $p^2$
Cryptography and Security
2018-04-24 v4 Number Theory
Abstract
We consider the -error linear complexity of a new binary sequence of period , proposed in the recent paper "New generalized cyclotomic binary sequences of period ", by Z. Xiao et al., who calculated the linear complexity of the sequences (Designs, Codes and Cryptography, 2017, https://doi.org/10.1007/s10623-017-0408-7). More exactly, we determine the values of -error linear complexity over for almost in terms of the theory of Fermat quotients. Results indicate that such sequences have good stability.
Keywords
Cite
@article{arxiv.1711.06063,
title = {On error linear complexity of new generalized cyclotomic binary sequences of period $p^2$},
author = {Chenhuang Wu and Chunxiang Xu and Zhixiong Chen and Pinhui Ke},
journal= {arXiv preprint arXiv:1711.06063},
year = {2018}
}