摘要
该文对单圈T函数输出序列的k-错线性复杂度进行了深入研究,利用多项式理论和Chan Games算法,分析得到了当n=2t时,单圈T函数输出序列线性复杂度的n个下降点及其对应位置的k-错线性复杂度,并给出了k-错线性复杂度的分布和k-错线性复杂度曲线。
The k-error linear complexity of the output sequences of single cycle T-function is investigated with the polynomial theory and the Chan Games algorithm as the main tools.All of the linear complexity drop points and the k-error linear complexity on the drop position of the output sequences are given when.The distribution of k-error linear complexity and k-error linear complexity profile of the output sequences of single cycle T-function are given.
出处
《电子与信息学报》
EI
CSCD
北大核心
2011年第7期1765-1769,共5页
Journal of Electronics & Information Technology
关键词
密码学
T函数
线性复杂度
K-错线性复杂度
Cryptography
T-functions
Linear complexity
k-error linear complexity
