通信学报
通信學報
통신학보
JOURNAL OF CHINA INSTITUTE OF COMMUNICATIONS
2014年
3期
135-139
,共5页
序列密码%2-adic复杂度%k-错2-adic复杂度%单圈T-函数%权位序列
序列密碼%2-adic複雜度%k-錯2-adic複雜度%單圈T-函數%權位序列
서렬밀마%2-adic복잡도%k-착2-adic복잡도%단권T-함수%권위서렬
stream cipher%2-adic complexity%k-error 2-adic complexity%single cycle T-functions%coordinate se-quences
研究了由F2n上单圈 T-函数所导出权位序列的2-adic 复杂度，设 j为整数，01≤ j≤n-。结论表明，第 j权位序列2-adic复杂度的上界为2lb(21)j +。另外，讨论了与所有单圈 T-函数所导出第 j权位序列相对应的2-adic整数的分布，分布情况说明这个上界是可以达到的。最后，研究了权位序列的1-错2-adic复杂度。研究结果表明对所有11≤j≤n-，权位序列x j的1-错2-adic 复杂度都与其2-adic复杂度相同。
研究瞭由F2n上單圈 T-函數所導齣權位序列的2-adic 複雜度，設 j為整數，01≤ j≤n-。結論錶明，第 j權位序列2-adic複雜度的上界為2lb(21)j +。另外，討論瞭與所有單圈 T-函數所導齣第 j權位序列相對應的2-adic整數的分佈，分佈情況說明這箇上界是可以達到的。最後，研究瞭權位序列的1-錯2-adic複雜度。研究結果錶明對所有11≤j≤n-，權位序列x j的1-錯2-adic 複雜度都與其2-adic複雜度相同。
연구료유F2n상단권 T-함수소도출권위서렬적2-adic 복잡도，설 j위정수，01≤ j≤n-。결론표명，제 j권위서렬2-adic복잡도적상계위2lb(21)j +。령외，토론료여소유단권 T-함수소도출제 j권위서렬상대응적2-adic정수적분포，분포정황설명저개상계시가이체도적。최후，연구료권위서렬적1-착2-adic복잡도。연구결과표명대소유11≤j≤n-，권위서렬x j적1-착2-adic 복잡도도여기2-adic복잡도상동。
The 2-adic complexities of the coordinate sequences derived from single cycle T-functions over 2nF were in-vestigated. Let j be an integer such that 0 1≤ j≤n- . It is shown that the 2-adic complexity of the j th coordinate sequence is upper bounded by 2lb(2 1)j + . The distribution of the corresponding 2-adic number associated with the j th coordinate sequence of all single cycle T-functions was also discussed, which implies that the upper bound is attainable. Moreover, 1-error 2-adic complexity was also studied. It was proved that the 1-error 2-adic complexity of the j th coor-dinate sequence is equal to its 2-adic complexity except for j=0 .
