修正Jacobi序列2-adic复杂度的一个下界
A lower bound on the 2-adic complexity of modified Jacobi sequence
摘要:
设$p,q$是满足$\mathrm{gcd}(p-1,q-1)=d$的不同素数,$D_i$,$i=0,1,\cdots,d-1$是具有$Z_{pq}^{\ast}=\cup_{i=0}^{d-1}D_i$的Whiteman广义分圆类.本文给出了基于广义分圆集$D_0^{\ast}=\sum_{i=0}^{\frac{d}{2}-1}D_{2i}$和$D_1^{\ast}=\sum_{i=0}^{\frac{d}{2}-1}D_{2i+1}$的高斯周期值。作为应用,我们确定了修正Jacobi序列的2-adic复杂度的一个下界。结果表明,修正Jacobi序列的2-adic复杂度至少为周期为$N=pq$的$pq-p-q-1$.这表明修正Jacobi序列的2-adic复杂度足以抵抗带有进位移位寄存器的反馈有理近似算法的攻击。
英文摘要:
Let $p,q$ be distinct primes satisfying $\mathrm{gcd}(p-1,q-1)=d$ and let $D_i$, $i=0,1,\cdots,d-1$, be Whiteman's generalized cyclotomic classes with $Z_{pq}^{\ast}=\cup_{i=0}^{d-1}D_i$. In this paper, we give the values of Gauss periods based on the generalized cyclotomic sets $D_0^{\ast}=\sum_{i=0}^{\frac{d}{2}-1}D_{2i}$ and $D_1^{\ast}=\sum_{i=0}^{\frac{d}{2}-1}D_{2i+1}$. As an application, we determine a lower bound on the 2-adic complexity of modified Jacobi sequence. Our result shows that the 2-adic complexity of modified Jacobi sequence is at least $pq-p-q-1$ with period $N=pq$. This indicates that the 2-adic complexity of modified Jacobi sequence is large enough to resist the attack of the rational approximation algorithm (RAA) for feedback with carry shift registers (FCSRs).
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。