摘要
2-adic复杂度是衡量流密码系统安全性能的一个重要指标．本文证明了周期为2n的二元序列的2-adic复杂度的计算可以规约为两个周期为n的二元序列的2-adic复杂度的计算，这里n是正整数．通过结合一些已知算法，可以有效地确定某些特殊周期二元序列的2-adic复杂度的上界。
2-adic complexity of periodic sequences is one of the important security indices of stream cipher systems.In this paper, we prove that the computation of the 2-adic complexity of a sequence with period 2n can be reduced to the computation of the 2-adic complexity of two sequences with period n, where n is a positive integer.By combining with some known algorithms, we can determine an upper bound for the 2-adic complexity of binary sequences with some special period efficiently.
出处
《电子学报》
EI
CAS
CSCD
北大核心
2007年第B12期18-21,共4页
Acta Electronica Sinica
基金
国家自然科学基金（No.60473029,No.60673072）
