nach oben

Cryptography and Communications

Erschienen in:

07.09.2021

The estimate of the linear complexity of generalized cyclotomic binary and quaternary sequences with periods pⁿ and 2pⁿ

verfasst von: Vladimir Edemskiy, Nikita Sokolovskiy

Erschienen in: Cryptography and Communications | Ausgabe 2/2022

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config

KI-gestützte Suche

Aus

Abstract

In this paper, first we consider the linear complexity of quaternary sequences over the finite ring of order four and the finite field of order four. These sequences are constructed from new generalized cyclotomic classes modulo pⁿ. Second, we study the linear complexity of new generalized cyclotomic binary sequences of period 2pⁿ recently proposed by Ouyang et al. (Des. Codes Cryptogr. 87(5), 1–12 2019). We generalized results presented in this work and discuss the author’s conjecture. In conclusion, we again derive the linear complexity of quaternary sequences with period 2pⁿ over the finite ring of order four and the finite field of order four. We use generalized cyclotomic classes modulo 2pⁿ to define these sequences.

Vorheriger Artikel Differential and boomerang spectrums of some power permutations

Nächster Artikel Minimal linear codes from weakly regular bent functions

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

über 102.000 Bücher
über 537 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Finance + Banking
Management + Führung
Marketing + Vertrieb
Maschinenbau + Werkstoffe
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 390 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Maschinenbau + Werkstoffe

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 340 Zeitschriften

aus folgenden Fachgebieten:

Bauwesen + Immobilien
Business IT + Informatik
Finance + Banking
Management + Führung
Marketing + Vertrieb
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Chen, Z., Edemskiy, V.: Linear complexity of quaternary sequences over z₄ derived from generalized cyclotomic classes modulo 2p. Int. J. Netw. Secur. 19(4), 613–622 (2017)

Cusick, T., Ding, C., Renvall, A.: Stream Ciphers and Number Theory. North-holland mathematical library. Elsevier (2004)

Ċeṡmelioġlu, A., Meidl, W. Carlet, C., Pott, A. (eds.): A General Approach to Construction and Determination of the Linear Complexity of Sequences Based on Cosets. Springer, Berlin (2010)

Dorais, F.G., Klyve, D.: A Wieferich prime search up to 6.7 × 10¹⁵. J. Integer Sequen. 14(11.9.2), 1–14 (2011)MATH

Edemskiy, V.: About computation of the linear complexity of generalized cyclotomic sequences with period p^n+ 1. Des. Codes Cryptogr. 61(3), 251–260 (2011)MathSciNetCrossRef

Edemskiy, V., Li, C., Zeng, X., Helleseth, T.: The linear complexity of generalized cyclotomic binary sequences of period pⁿ. Des. Codes Cryptogr. 87(5)), 1183–1197 (2019)MathSciNetCrossRef

Edemskiy, V., Antonova, O.: The linear complexity of generalized cyclotomic sequences with period 2pⁿ. Appl. Algebra Eng. Commun. Comput. 25(3), 213–223 (2014)CrossRef

Fan, C., Ge, G.: A unified approach to Whiteman’s and Ding-Helleseth’s generalized cyclotomy over residue class rings. IEEE Trans. Inform. Theory 60(2), 1326–1336 (2014)MathSciNetCrossRef

Ke, P., Zhong, Y., Zhang, S.: Linear Complexity of a New Class of Quaternary Generalized Cyclotomic Sequence with Period 2p^m. Complexity, Article ID 6538970, https://doi.org/10.1155/2020/6538970 (2020)

10.

Ke, P., Zhang, S.: New classes of quaternary cyclotomic sequence of length 2p^m with high linear complexity. Inf. Process. Lett. 112(16), 646–650 (2012)CrossRef

11.

Kim, Y.J., Song, H.Y.: Linear Complexity of Prime N-Square Sequences. In: 2008 IEEE International Symposium on Information Theory, pp. 2405–2408 (2008)

12.

Lidl, R., Niederreiter, H.: Finite Fields. Encyclopedia of Mathematics and Its Applications, vol. 20. Addison-Wesley (1983)

13.

Liu, L., Yang, X., Wei, B., Wu, L.: A new class of quaternary generalized cyclotomic sequences of order 2d and length 2p^m with high linear complexity. Int. J. Wavelets Multiresol. Inf. Process. 16(1), Art ID 1850006 (2018)

14.

Ouyang, Y., Xie, X.: Linear complexity of generalized cyclotomic sequences of period 2p^m. Des. Codes Cryptogr. 87(5), 1–12 (2019)MathSciNet

15.

Udaya, P., Siddiqi, M.U.: Generalized GMW quadriphase sequences satisfying the Welch bound with equality. Appl. Algebra Eng. Commun. Comput. 10, 203–225 (2000)MathSciNetCrossRef

16.

Wan, Z.X.: Finite fields and galois rings. Singapore World Scientific Publisher (2003)

17.

Wu, C., Chen, Z., Du, X.: The linear complexity of q-ary generalized cyclotomic sequences of period p^m. J. Wuhan Univ. 59(2), 129–136 (2013)MathSciNetMATH

18.

Ye, Z., Ke, P., Wu, C.: A further study of the linear complexity of new binary cyclotomic sequence of length pⁿ. Appl. Algebra Eng. Commun. Comput. 30(3), 217–231 (2019)CrossRef

19.

Yan, T., Li, S., Xiao, G.: On the linear complexity of generalized cyclotomic sequences with the period p^m. Appl. Math. Lett. 21(2), 187–193 (2008)MathSciNetCrossRef

20.

Zeng, X., Cai, H., Tang, X., Yang, Y.: Optimal frequency hopping sequences of odd length. IEEE Trans. Inform. Theory 59(5), 3237–3248 (2013)MathSciNetCrossRef

21.

Zhou, X., Li, X., Xiao, J., Tang, Y., Abbasi, R., Xu, L.: Linear complexity of generalized cyclotomic binary sequences of order 2 d and length 2p^m. Int. J. Wavelets Multiresol. Inf. Process. 14(5), Art ID 1650040 (2016)

22.

Xiao, Z., Zeng, X., Li, C., Helleseth, T.: New generalized cyclotomic binary sequences of period p². Des. Codes Cryptogr. 86(7), 1483–1497 (2018)MathSciNetCrossRef

23.

Zhang, J., Zhao, C. -A., Ma, X.: Linear complexity of generalized cyclotomic binary sequences of length 2p^m. Appl. Algebra Eng. Commun. Comput. 21(2), 93–108 (2010)CrossRef

Titel: The estimate of the linear complexity of generalized cyclotomic binary and quaternary sequences with periods pn and 2pn
verfasst von: Vladimir Edemskiy
Nikita Sokolovskiy
Publikationsdatum: 07.09.2021
Verlag: Springer US
Erschienen in: Cryptography and Communications / Ausgabe 2/2022
Print ISSN: 1936-2447
Elektronische ISSN: 1936-2455
DOI: https://doi.org/10.1007/s12095-021-00534-7

Springer Professional

Abstract

Bitte loggen Sie sich ein, um Zugang zu Ihrer Lizenz zu erhalten.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Springer Professional "Technik"

Springer Professional "Wirtschaft"

Weitere Artikel der Ausgabe 2/2022

Improving bounds on probabilistic affine tests to estimate the nonlinearity of Boolean functions

Improved transformation algorithms for generalized Galois NLFSRs

Minimal linear codes from weakly regular bent functions

Differential and boomerang spectrums of some power permutations

On the behavior of some APN permutations under swapping points

Jump and hop randomness tests for binary sequences