Enumeration results on the joint linear complexity of multisequences
Enumeration results on the joint linear complexity of multisequences
复制标题
DOI：
10.1016/j.ffa.2005.03.005
复制
发表时间：
2006-11
期刊：
影响因子：
--
通讯作者：
Li-Ping Wang;H. Niederreiter
中科院分区：
文献类型：
--
作者：
Li-Ping Wang;H. Niederreiter
流密码的最新发展表明人们对基于单词或矢量化的流密码产生了兴趣。这种流密码建议研究多序列的联合线性复杂度。本文利用第一作者基于函数域格基约简算法的多序列线性反馈移位寄存器综合算法，提出了一种确定Nn(m)(L)值的方法，Nn(m)(L)是有限域Fq上长度为n的m重多重序列的数量，具有第n个联合线性复杂度L。此外，还给出了Nn(m)(L)和Nn(m)(L)的闭式表达式 给出了m=2时联合线性复杂度的期望值及其方差的公式。
Recent developments in stream ciphers point towards an interest in word-based or vectorized stream ciphers. Such stream ciphers suggest the study of the joint linear complexity of multisequences. In this paper, using the first author's multisequence linear feedback shift-register synthesis algorithm based on a lattice basis reduction algorithm in function fields, we present a method to determine the value of Nn(m)(L), the number of m-fold multisequences of length n over a finite field Fqwith nth joint linear complexity L. Furthermore, a closed-form expression for Nn(m)(L) and formulas for the expected value of the joint linear complexity and its variance are given when m=2.