当前位置: X-MOL 学术Cryptogr. Commun. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
2-Adic complexity of two constructions of binary sequences with period 4N and optimal autocorrelation magnitude
Cryptography and Communications ( IF 1.2 ) Pub Date : 2021-07-19 , DOI: 10.1007/s12095-021-00498-8
Zibi Xiao 1 , Xiangyong Zeng 2
Affiliation  

Three constructions of binary sequences with period 4N and optimal autocorrelation value or optimal autocorrelation magnitude have been presented by Tang and Gong based on interleaving technique. In this paper, the 2-adic complexity of the sequences with optimal autocorrelation magnitude constructed from the Legendre sequence pair or the twin-prime sequence pair is investigated. With the method proposed by Hu, we completely determine the 2-adic complexity of the sequences by calculating the exact autocorrelation distribution of the sequences and discussing the greatest common divisors. Results show that the 2-adic complexity of these sequences is either maximum or very close to maximum.



中文翻译:

具有周期 4N 和最佳自相关幅度的二进制序列的两种构造的 2-Adic 复杂度

Tang和Gong基于交织技术提出了周期为4N和最优自相关值或最优自相关幅度的二进制序列的三种构造。本文研究了由Legendre序列对或双素数序列对构建的具有最佳自相关幅度的序列的2-adic复杂度。使用 Hu 提出的方法,我们通过计算序列的精确自相关分布并讨论最大公约数来完全确定序列的 2-adic 复杂度。结果表明,这些序列的 2-adic 复杂度要么是最大值,要么非常接近最大值。

更新日期:2021-07-19
down
wechat
bug