降低$GF(p^m)$上周期序列线性复杂度的计算
Reducing the Computation of Linear Complexities of Periodic Sequences over $GF(p^m)$
摘要:
$GF(p^m)$上周期序列的线性复杂度在密码学和通信中起着重要的作用[12]。本文证明了将$GF(p^m)$上周期$un$序列的线性复杂度和最小联络多项式的计算简化为$u$周期$n$序列的线性复杂度和最小联络多项式的计算的一个结果。结果保持不变需要条件$u|p^m-1$和$\gcd(n,p^m-1)=1$。给出了这种约化在确定$GF(p^m)$上序列的线性复杂度和最小联络多项式的快速算法中的一些应用。
英文摘要:
The linear complexity of a periodic sequence over $GF(p^m)$ plays an important role in cryptography and communication [12]. In this correspondence, we prove a result which reduces the computation of the linear complexity and minimal connection polynomial of a period $un$ sequence over $GF(p^m)$ to the computation of the linear complexities and minimal connection polynomials of $u$ period $n$ sequences. The conditions $u|p^m-1$ and $\gcd(n,p^m-1)=1$ are required for the result to hold. Some applications of this reduction in fast algorithms to determine the linear complexities and minimal connection polynomials of sequences over $GF(p^m)$ are presented.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。