On k-error linear complexity of binary sequences derived from Euler quotients modulo 2p
Cryptography and Security
2019-10-11 v1
Abstract
We consider the -error linear complexity of binary sequences derived from Eluer quotients modulo ( is an odd prime), recently introduced by J. Zhang and C. Zhao. We adopt certain decimal sequences to determine the values of -error linear complexity for all . Our results indicate that such sequences have good stability from the viewpoint of cryptography.
Cite
@article{arxiv.1910.04607,
title = {On k-error linear complexity of binary sequences derived from Euler quotients modulo 2p},
author = {Chenhuang Wu and Vladimir Edemskiy and Chunxiang Xu},
journal= {arXiv preprint arXiv:1910.04607},
year = {2019}
}