单圈T函数输出序列k-错线性复杂度研究  

k-error Linear Complexity of Output Sequences of Single Cycle T-function

作　　者：罗小建[1] 胡斌[1] 

机构地区：[1]解放军信息工程大学电子技术学院,郑州450004

出　　处：《电子与信息学报》2011年第7期1765-1769,共5页Journal of Electronics & Information Technology

摘　　要：该文对单圈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.

关 键 词：密码学 T函数 线性复杂度 K-错线性复杂度 

分 类 号：TN918[电子电信—通信与信息系统]