Skip to main content
Top
Published in: Journal of Applied Mathematics and Computing 1-2/2017

20-04-2016 | Original Research

On the linear complexity of Hall’s sextic residue sequences over \({ GF}(q)\)

Authors: Vladimir Edemskiy, Nikita Sokolovskiy

Published in: Journal of Applied Mathematics and Computing | Issue 1-2/2017

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

In this paper, we derive the linear complexity of Hall’s sextic residue sequences over the finite field of odd prime order. The order of the field is not equal to a period of the sequence. Our results show that Hall’s sextic residue sequences have high linear complexity over the finite field of odd order. Also we estimate the linear complexity of series of generalized sextic cyclotomic sequences. The linear complexity of these sequences is larger than half of the period.

Dont have a licence yet? Then find out more about our products and how to get one now:

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!

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!

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!

Literature
1.
2.
go back to reference Cusick, T.W., Ding, C., Renvall, A.: Stream Ciphers and Number Theory. North-Holland Publishing Co., Amsterdam (1998)MATH Cusick, T.W., Ding, C., Renvall, A.: Stream Ciphers and Number Theory. North-Holland Publishing Co., Amsterdam (1998)MATH
3.
go back to reference Dai, Z., Gong, G., Song, H.-Y., Ye, D.: Trace representation and linear complexity of binary eth power residue sequences of period p. IEEE Trans. Inf. Theory 57(3), 1530–1547 (2011)CrossRef Dai, Z., Gong, G., Song, H.-Y., Ye, D.: Trace representation and linear complexity of binary eth power residue sequences of period p. IEEE Trans. Inf. Theory 57(3), 1530–1547 (2011)CrossRef
4.
5.
go back to reference Ding, C., Helleseth, T., Shan, W.: On the linear complexity of Legendre sequences. IEEE Trans. Inf. Theory 44(3), 1276–1278 (1998)MathSciNetCrossRefMATH Ding, C., Helleseth, T., Shan, W.: On the linear complexity of Legendre sequences. IEEE Trans. Inf. Theory 44(3), 1276–1278 (1998)MathSciNetCrossRefMATH
7.
go back to reference Edemskii, V.A.: On the linear complexity of binary sequences on the basis of biquadratic and sextic residue classes. Discrete Math. Appl. 20(1), 75–84 (2010), translation from Diskretn. Mat. 22(4), 74–82 (2010) Edemskii, V.A.: On the linear complexity of binary sequences on the basis of biquadratic and sextic residue classes. Discrete Math. Appl. 20(1), 75–84 (2010), translation from Diskretn. Mat. 22(4), 74–82 (2010)
8.
go back to reference Edemskiy, V.: About computation of the linear complexity of generalized cyclotomic sequences with period \(p^{n+1}\). Des. Codes Cryptogr. 61, 251–260 (2011)MathSciNetCrossRefMATH Edemskiy, V.: About computation of the linear complexity of generalized cyclotomic sequences with period \(p^{n+1}\). Des. Codes Cryptogr. 61, 251–260 (2011)MathSciNetCrossRefMATH
9.
go back to reference 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, 1326–1336 (2014)MathSciNetCrossRef 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, 1326–1336 (2014)MathSciNetCrossRef
10.
go back to reference Golomb, S.W., Gong, G.: Signal Design for Good Correlation: For Wireless Communications, Cryptography and Radar Applications. Cambridge University Press, New York (2005)CrossRefMATH Golomb, S.W., Gong, G.: Signal Design for Good Correlation: For Wireless Communications, Cryptography and Radar Applications. Cambridge University Press, New York (2005)CrossRefMATH
11.
go back to reference Green, D.H., Smith, M.D., Martzoukos, N.: Linear complexity of polyphase power residue sequences. IEE Proc. Commun. 149(4), 195–201 (2002)CrossRef Green, D.H., Smith, M.D., Martzoukos, N.: Linear complexity of polyphase power residue sequences. IEE Proc. Commun. 149(4), 195–201 (2002)CrossRef
12.
go back to reference Hall, M.: Combinatorial Theory. Wiley, New York (1975) Hall, M.: Combinatorial Theory. Wiley, New York (1975)
13.
go back to reference Ireland, K., Rosen, M.: A Classical Introduction to Modern Number Theory. Springer, Berlin (1982)CrossRefMATH Ireland, K., Rosen, M.: A Classical Introduction to Modern Number Theory. Springer, Berlin (1982)CrossRefMATH
14.
go back to reference Kim, J.H., Song, H.Y.: On the linear complexity of Hall’s sextic residue sequences. IEEE Trans. Inf. Theory 45, 2094–2096 (2001)MathSciNetMATH Kim, J.H., Song, H.Y.: On the linear complexity of Hall’s sextic residue sequences. IEEE Trans. Inf. Theory 45, 2094–2096 (2001)MathSciNetMATH
15.
go back to reference Wang, Q.: Linear complexity of binary cyclotomic sequences of order 6. J. Appl. Math. Comput. 49(1), 119–125 (2015)MathSciNetMATH Wang, Q.: Linear complexity of binary cyclotomic sequences of order 6. J. Appl. Math. Comput. 49(1), 119–125 (2015)MathSciNetMATH
16.
go back to reference Wang, Q., Lin, D., Guang, X.: On the linear complexity of Legendre sequences over \(F_q,\). IEICE Trans. Fundam. E97–A(7), 1627–1630 (2014)CrossRef Wang, Q., Lin, D., Guang, X.: On the linear complexity of Legendre sequences over \(F_q,\). IEICE Trans. Fundam. E97–A(7), 1627–1630 (2014)CrossRef
17.
go back to reference Wang, Q., Jiang, Y., Lin, D.: Linear complexity of Ding–Helleseth sequences of order 2 over \(GF(l)\). Cryptogr. Commun. 8(1), 33–49 (2015)MathSciNetCrossRefMATH Wang, Q., Jiang, Y., Lin, D.: Linear complexity of Ding–Helleseth sequences of order 2 over \(GF(l)\). Cryptogr. Commun. 8(1), 33–49 (2015)MathSciNetCrossRefMATH
Metadata
Title
On the linear complexity of Hall’s sextic residue sequences over
Authors
Vladimir Edemskiy
Nikita Sokolovskiy
Publication date
20-04-2016
Publisher
Springer Berlin Heidelberg
Published in
Journal of Applied Mathematics and Computing / Issue 1-2/2017
Print ISSN: 1598-5865
Electronic ISSN: 1865-2085
DOI
https://doi.org/10.1007/s12190-016-1010-2

Other articles of this Issue 1-2/2017

Journal of Applied Mathematics and Computing 1-2/2017 Go to the issue

Premium Partner