Journal of University of Science and Technology of China ›› 2013, Vol. 43 ›› Issue (2): 169-172.DOI: 10.3969/j.issn.0253-2778.2013.02.013
Previous Articles
LI Fulin
Received:
Revised:
Online:
Published:
Contact:
About author:
Abstract: To determine the 2-adic joint complexity of pn-periodic binary multisequences generated by feedback shift registers with carry operation (FCSR), an algorithm was presented and its theoretical derivation was provided, which yields an upper bound for the 2-adic joint complexity of a pn-periodic binary multisequence. Under a fixed condition, this upper bound is good.
Key words: cryptology, multisequence, feedback shift register, 2-adic joint complexity
LI Fulin, ZHU Shixin. A fast algorithm for the 2-adic joint complexity of pn -periodic a binary multisequence[J]. Journal of University of Science and Technology of China, 2013, 43(2): 169-172.
0 / / Recommend
Add to citation manager EndNote|Ris|BibTeX
URL: http://just-cn.ustc.edu.cn/EN/10.3969/j.issn.0253-2778.2013.02.013
http://just-cn.ustc.edu.cn/EN/Y2013/V43/I2/169
