中国科学技术大学学报 ›› 2013, Vol. 43 ›› Issue (2): 169-172.DOI: 10.3969/j.issn.0253-2778.2013.02.013
• 原创论文 • 上一篇
李富林
收稿日期:
修回日期:
出版日期:
发布日期:
LI Fulin
Received:
Revised:
Online:
Published:
Contact:
About author:
摘要： 本文提出了一个快速算法确定pn-周期二元FCSR多维序列2-adic联合复杂度，给出了该算法理论上的推导，产生了pn-周期二元多维序列2-adic联合复杂度一个上界，在确定的条件下，这个上界是好的.
关键词: 密码学, 多维序列, 反馈移位寄存器, 2-adic联合复杂度
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
李富林，朱士信. pn -周期二元多维序列2-adic联合复杂度快速算法[J]. 中国科学技术大学学报, 2013, 43(2): 169-172.
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 / / 推荐
导出引用管理器 EndNote|Ris|BibTeX
链接本文: http://just-cn.ustc.edu.cn/CN/10.3969/j.issn.0253-2778.2013.02.013
http://just-cn.ustc.edu.cn/CN/Y2013/V43/I2/169
