On the joint 2-adic complexity of binary multisequences
On the joint 2-adic complexity of binary multisequences
复制标题
DOI：
10.1051/ita/2012011
复制
发表时间：
2012-07
期刊：
影响因子：
--
通讯作者：
Lu Zhao;Qiao-yan Wen
中科院分区：
文献类型：
--
作者：
Lu Zhao;Qiao-yan Wen
联合二进复杂度是衡量多序列密码安全性的一个新的重要指标。本文将通常的傅里叶变换推广到多序列的情况，并给出了联合2进复杂度的上界。此外，对于n周期的多序列，我们讨论了序列与其傅里叶系数的关系。基于这一关系，我们确定了具有给定联合2进复杂度的多序列数目的下界。
Joint 2-adic complexity is a new important index of the cryptographic security for multisequences. In this paper, we extend the usual Fourier transform to the case of multisequences and derive an upper bound for the joint 2-adic complexity. Furthermore, for the multisequences with p n -period, we discuss the relation between sequences and their Fourier coefficients. Based on the relation, we determine a lower bound for the number of multisequences with given joint 2-adic complexity.