In this paper, the 2-adic complexity of a class of balanced Whiteman generalized cyclotomic sequences of period $pq$ is considered. Through calculating the determinant of the circulant matrix constructed by one of these sequences, we derive a lower bound on the 2-adic complexity of the corresponding sequence, which further expands our previous work (Zhao C, Sun Y and Yan T. Study on 2-adic complexity of a class of balanced generalized cyclotomic sequences. Journal of Cryptologic Research,6(4):455-462, 2019). The result shows that the 2-adic complexity of this class of sequences is large enough to resist the attack of the rational approximation algorithm(RAA) for feedback with carry shift registers(FCSRs), i.e., it is in fact lower bounded by $pq-p-q-1$, which is far larger than one half of the period of the sequences. Particularly, the 2-adic complexity is maximal if suitable parameters are chosen.

中文翻译：

---

一类平衡广义广义环序列的2-adic复杂度的进一步结果

在本文中，考虑了周期为$ pq $的一类平衡Whiteman广义环原子序列的2-adic复杂度。通过计算由这些序列之一构成的循环矩阵的行列式，我们推导了相应序列的2-adic复杂度的下界，这进一步扩展了我们先前的工作（Zhao C，Sun Y和YanT。研究2一类平衡的广义环原子序列的-adic复杂性。密码学研究，6（4）：455-462，2019）。结果表明，此类序列的2-adic复杂度足够大，足以抵御有理移位寄存器（FCSR）反馈的有理逼近算法（RAA）的攻击，即实际上它的下限为$ pq -pq-1 $，远大于序列周期的一半。特别，