nach oben

Designs, Codes and Cryptography

Erschienen in:

30.06.2018

The linear complexity of generalized cyclotomic binary sequences of period \(p^n\)

verfasst von: Vladimir Edemskiy, Chunlei Li, Xiangyong Zeng, Tor Helleseth

Erschienen in: Designs, Codes and Cryptography | Ausgabe 5/2019

Einloggen, um Zugang zu erhalten

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

search-config

KI-gestützte Suche

Aus

Abstract

This paper examines the linear complexity of a family of generalized cyclotomic binary sequences of period \(p^n\) recently proposed by Xiao et al. (Des Codes Cryptogr, 2017, https://doi.org/10.1007/s10623-017-0408-7), where a conjecture about the linear complexity in the special case that \(f=2^r\) for a positive integer r was made. We prove the conjecture and also extend the result to more general even integers f.

Vorheriger Artikel Using Bernstein–Vazirani algorithm to attack block ciphers

Çeşmelioğlu A., Meidl W.: A general approach to construction and determination of the linear complexity of sequences based on cosets. In: Carlet C., Pott A. (eds.) Sequences and Their Applications—SETA 2010, pp. 125–138. Springer, Berlin (2010).

Cusick T., Ding C., Renvall A.: Stream Ciphers and Number Theory. North-Holland Mathematical Library. Elsevier, North-Holland (2004).MATH

Ding C.: Cyclotomic constructions of cyclic codes with length being the product of two primes. IEEE Trans. Inf. Theory 58(4), 2231–2236 (2012).MathSciNetCrossRefMATH

Ding C., Helleseth T.: New generalized cyclotomy and its applications. Finite Fields Appl. 4(2), 140–166 (1998).MathSciNetCrossRefMATH

Ding C., Helleseth T.: Generalized cyclotomic codes of length \(p_1^{e_1}\ldots p_t^{e_t}\). IEEE Trans. Inf. Theory 45(2), 467–474 (1999).CrossRefMATH

Dorais F.G., Klyve D.: A Wieferich prime search up to \(6.7 \times 10^{15}\). J. Integer Seq. 14(11.9.2), 1–14 (2011).MATH

Du X., Chen Z.: A generalization of the Hall’s sextic residue sequences. Inf. Sci. 222, 784–794 (2013).MathSciNetCrossRefMATH

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).MathSciNetCrossRefMATH

Edemskiy V.: The linear complexity of new binary cyclotomic sequences of period \(p^n\). CoRR (2017). arXiv:1712.03947

10.

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

11.

Golomb S.W.: Shift Register Sequences. Holden-Day, San Francisco (1967).MATH

12.

Ireland K., Rosen M.: A Classical Introduction to Modern Number Theory. Graduate Texts in Mathematics. Springer, New York (1990).CrossRefMATH

13.

Jin S.Y., Kim Y.J., Song H.Y.: Autocorrelation of new generalized cyclotomic sequences of period \(p^n\). IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 93(11), 2345–2348 (2010).CrossRef

14.

Ke P., Zhang J., Zhang S.: On the linear complexity and the autocorrelation of generalized cyclotomic binary sequences of length \(2p^m\). Des. Codes Cryptogr. 67(3), 325–339 (2013).MathSciNetCrossRefMATH

15.

Kewat P.K., Kumari P.: Cyclic codes from the second class two-prime Whiteman’s generalized cyclotomic sequence with order \(6\). Cryptogr. Commun. 9(4), 475–499 (2017).MathSciNetCrossRefMATH

16.

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).

17.

Li S., Chen Z., Fu X., Xiao G.: Autocorrelation values of new generalized cyclotomic sequences of order two and length \(pq\). J. Comput. Sci. Technol. 22(6), 830–834 (2007).MathSciNetCrossRef

18.

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

19.

Whiteman A.L.: A family of difference sets. Illinois J. Math. 6(1), 107–121 (1962).MathSciNetCrossRefMATH

20.

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

21.

Wu C., Xu C., Chen Z., Ke P.: On error linear complexity of new generalized cyclotomic binary sequences of period \(p^2\). CoRR (2017). arXiv:1711.06063

22.

Xiao Z., Zeng X., Li C., Helleseth T.: New generalized cyclotomic binary sequences of period \(p^2\). Des. Codes Cryptogr. (2017). https://doi.org/10.1007/s10623-017-0408-7.

23.

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).MathSciNetCrossRefMATH

24.

Ye Z., Ke P., Wu C.: A note on a conjecture of new binary cyclotomic sequences of length \(p^n\). CoRR (2017). arXiv:1712.08886

25.

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

Titel: The linear complexity of generalized cyclotomic binary sequences of period
verfasst von: Vladimir Edemskiy
Chunlei Li
Xiangyong Zeng
Tor Helleseth
Publikationsdatum: 30.06.2018
Verlag: Springer US
Erschienen in: Designs, Codes and Cryptography / Ausgabe 5/2019
Print ISSN: 0925-1022
Elektronische ISSN: 1573-7586
DOI: https://doi.org/10.1007/s10623-018-0513-2

Springer Professional

The linear complexity of generalized cyclotomic binary sequences of period \(p^n\)

Abstract

Premium Partner

Springer Professional

Abstract

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

Weitere Artikel der Ausgabe 5/2019

Orthogonal one-factorizations of complete multipartite graphs

Obituary of Jacques Wolfmann (1932–2018)

Cryptanalysis of MORUS

On non-full-rank perfect codes over finite fields

Using Bernstein–Vazirani algorithm to attack block ciphers

On binary de Bruijn sequences from LFSRs with arbitrary characteristic polynomials

Premium Partner