• DocumentCode
    985170
  • Title

    On the Linear Complexity and k -Error Linear Complexity Over {BBF }_{p} of

  • Author

    Aly, Heba ; Meidl, Wilfried

  • Author_Institution
    Dept. of Math., Cairo Univ., Giza
  • Volume
    53
  • Issue
    12
  • fYear
    2007
  • Firstpage
    4755
  • Lastpage
    4761
  • Abstract
    The d-ary Sidel´nikov sequence S = s0, s1... of period q-1 for a prime power q=pm is a frequently analyzed sequence in the literature. Recently, it turned out that the linear complexity over Fp of the d-ary Sidel´nikov sequence is considerably smaller than the period if the sequence element s(q-1)/2mod(q-1) is chosen adequately. In this paper this work is continued and tight lower bounds on the linear complexity over Fp of the d-ary Sidel´nikov sequence are given. For certain cases exact values are provided. Finally, results on the k-error linear complexity over Fp of the d-ary Sidel´nikov sequence are presented.
  • Keywords
    computational complexity; sequences; d-ary Sidel\´nikov sequence; k-error linear complexity; linear complexity; Galois fields; Hamming distance; Mathematics; Security; Vectors; $k$ -error linear complexity; Sidel\´nikov sequences; linear complexity; stream ciphers;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/TIT.2007.909129
  • Filename
    4385762
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=985170