The Stability of Output Sequences of Single Cycle T-function
-
摘要: k-错线性复杂度是衡量序列稳定性的重要指标，该文对单圈T函数按位输出序列的k-错线性复杂度进行了深入研究，利用序列线性复杂度的多项式求解法和Chan Games算法，分析得到了当输入规模n=2tt时，单圈T函数按位输出序列k-错线性复杂度的分布，并进一步给出了该序列的k-错线性复杂度曲线。Abstract: The k-error linear complexity of the output sequences by-bit of single cycle T-function is investigated with the polynomial and the Chan Games algorithm as the main tools. The distribution of k-error linear complexity and k-error linear complexity profile of the output sequences by-bit of single cycle T-function are presented when n=2t.
-
Key words:
- Cryptography /
- T-functions /
- Linear complexity /
- k-error linear complexity
-
Kurosawa K and Sato F. A relationship between linear complexity and k-error linear complexity[J].IEEE Transactions on Information Theory.2000, 46(2):694-698[8]Games R A and Chan A H. A fast algorithm for determining the complexity of a binary sequence with period [J].IEEE Transactions on Information Theory.1983, 29(4):144-146[12]王菊香. 周期序列的k-错线性复杂度分析和研究.[硕士论文],合肥工业大学, 2009.[16]Xu Li-qing. On GF(P)-linear complexities of binary sequences[J].The Journal of China Universities of Posts and Telecommunications.2009, 16(4):112-115 -
计量
- 文章访问数: 2818
- HTML全文浏览量: 52
- PDF下载量: 490
- 被引次数: 0
下载:
