zbMATH — the first resource for mathematics

The 2-adic complexity of a class of binary sequences with optimal autocorrelation magnitude. (English) Zbl 1453.94053
Summary: Recently, a class of binary sequences with optimal autocorrelation magnitude has been presented by W. Su et al. [Des. Codes Cryptography 86, No. 6, 1329–1338 (2018; Zbl 1387.94060)], based on Ding-Helleseth-Lam sequences and interleaving technique. The linear complexity of this class of sequences has been proved to be large enough to resist the B-M Algorithm by C. Fan [Des. Codes Cryptography 86, No. 10, 2441–2450 (2018; Zbl 1408.94923)]. In this paper, we study the 2-adic complexities of these sequences with period $$4p$$ and show they are no less than $$2p$$, i.e., its 2-adic complexity is large enough to resist the Rational Approximation Algorithm.

MSC:
 94A55 Shift register sequences and sequences over finite alphabets in information and communication theory 11B50 Sequences (mod $$m$$) 11T71 Algebraic coding theory; cryptography (number-theoretic aspects)
Full Text:
References:
 [1] Arasu, KT; Ding, C.; Helleseth, T.; Kumar, PV; Martinsen, HM, Almost difference sets and their sequences with optimal autocorrelation, IEEE Trans. Inform. Theory, 47, 2934-2943 (2001) · Zbl 1008.05027 [2] Ding, C.; Helleseth, T.; Lam, KY, Several classes of sequences with three-level autocorrelation, IEEE Trans. Inform. Theory, 45, 2606-2612 (1999) · Zbl 0983.94026 [3] Fan, C., The linear complexity of a class of binary sequences with optimal autocorrelation, Des. Codes Crypt., 86, 2441-2450 (2018) · Zbl 1408.94923 [4] Gong, G., Theory and applications of q-ary interleaved sequences, IEEE Trans. Inform. Theory, 41, 400-411 (1995) · Zbl 0943.94509 [5] Hu, H., Comments on “a new method to compute the 2-adic complexity of binary sequences”, IEEE Trans. Inform. Theory, 60, 5803-5804 (2014) · Zbl 1360.94277 [6] Klapper, A.; Goresky, M., Feedback shift registers, 2-adic span, and combiners with memory, J. Cryptol., 10, 111-147 (1997) · Zbl 0874.94029 [7] Li, N.; Tang, X., On the linear complexity of binary sequences of period 4N with optimal autocorrelation/magnitude, IEEE Trans. Inform. Theory, 57, 7597-7604 (2011) · Zbl 1365.94385 [8] Su, W.; Yang, Y.; Fan, C., New optimal binary sequences with period 4p via interleaving Ding-Helleseth-Lam sequences, Des. Codes Crypt., 86, 1329-1338 (2018) · Zbl 1387.94060 [9] Sun, Y.; Wang, Q.; Yan, T., The exact autocorrelation distribution and 2-adic complexity of a class of binary sequences with almost optimal autocorrelation, Cryptogr. Commun., 10, 467-477 (2018) · Zbl 1387.94061 [10] Tang, X.; Ding, C., New classes of balanced quaternary and almost balanced binary sequences with optimal autocorrelation value, IEEE Trans. Inform. Theory, 56, 6398-6405 (2010) · Zbl 1366.94456 [11] Tang, X.; Gong, G., New constructions of binary sequences with optimal autocorrelation value/magnitude, IEEE Trans. Inform. Theory, 56, 1278-1286 (2010) · Zbl 1366.94458 [12] Wang, Q.; Du, X., The linear complexity of binary sequences with optimal autocorrelation, IEEE Trans. Inform. Theory, 56, 6388-6397 (2010) · Zbl 1366.94465 [13] Xiong, H.; Qu, L.; Li, C., A new method to compute the 2-adic complexity of binary sequences, IEEE Trans. Inform. Theory, 60, 2399-2406 (2014) · Zbl 1360.94289 [14] Xiong, H.; Qu, L.; Li, C., 2-Adic complexity of binary sequences with interleaved structure, Finite Fields and Their Applications, 33, 14-28 (2015) · Zbl 1368.94080 [15] Yan, T.; Chen, Z.; Li, B., A general construction of binary interleaved sequences of period 4N with optimal autocorrelation, Inform. Sci., 287, 26-31 (2014) · Zbl 1355.94077 [16] Yang, M., Zhang, L., Feng, K.: On the 2-adic complexity of a class of binary sequences of period 4p with optimal autocorrelation magnitude. arXiv:1904.13012
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.