• DocumentCode
    1136423
  • Title

    Periodic sequences with large k-error linear complexity

  • Author

    Niederreiter, Harald

  • Author_Institution
    Inst. for Math. Sci., Nat. Univ. of Singapore, Singapore
  • Volume
    49
  • Issue
    2
  • fYear
    2003
  • Firstpage
    501
  • Lastpage
    505
  • Abstract
    We establish the existence of periodic sequences over a finite field which simultaneously achieve the maximum value (for the given period length) of the linear complexity and of the k-error linear complexity for small values of k. This disproves a conjecture of Ding, Xiao, and Shan (1991). The result is of relevance for the theory of stream ciphers.
  • Keywords
    computational complexity; cryptography; sequences; time-varying systems; cyclotomy; k-error linear complexity; periodic sequences; stream ciphers; Cryptography; Galois fields; Hamming distance; Linear feedback shift registers; Mathematics; Stability; Vectors;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

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