论文部分内容阅读
多重序列的联合线性复杂度是衡量基于字的流密码体系安全的一个重要指标.由元素取自Fq上的m重序列和元素取自Fqm上的单个序列之间的一一对应,Meidl和zbudak定义多重序列的广义联合线性复杂度为对应的单个序列的线性复杂度.在本文中,我们利用代数曲线的常数域扩张,研究两类多重序列的广义联合线性复杂度.更进一步,我们指出这两类多重序列同时具有高联合线性复杂度和高广义联合线性复杂度.
The joint linear complexity of multiple sequences is an important measure of the security of a word-based flow cryptosystem. The one-to-one correspondence between the m-heavy sequence of elements taken from Fq and the single sequence of elements taken from Fqm, Meidl and zbudak defines the generalized joint linear complexity of multiple sequences as the linear complexity of the corresponding single sequence.In this paper, we study the generalized joint linear complexity of two types of multiple sequences by using the constant domain expansion of algebraic curves.Furthermore, we point out Both types of multiple sequences have high joint linear complexity and high generalized joint linear complexity.