• DocumentCode
    2052816
  • Title

    Asymptotic behavior of normalized linear complexity of ultimately non-periodic binary sequences

  • Author

    Dai, Zongduo ; Jiang, Shaoquan ; Imamura, Kyoki ; Gong, Guang

  • Author_Institution
    Grad. Sch., Chinese Acad. of Sci., Beijing, China
  • fYear
    2004
  • fDate
    27 June-2 July 2004
  • Firstpage
    123
  • Abstract
    This paper describes the asymptotic behavior of normalized linear complexity of ultimately nonperiodic binary sequence. The linear complexity of sn, Ls(n), is defined as the length of the shortest linear feedback shift register which generates sn. The research method and results studied in this paper seem to be very useful in characterizing the purely random sequence and distinguishing a key stream generator from a uniformly random sequence.
  • Keywords
    binary sequences; computational complexity; random sequences; asymptotic behavior; key stream generator; linear feedback shift register; normalized linear complexity; random sequence; ultimately nonperiodic binary sequence; Algorithm design and analysis; Binary sequences; Character generation; Content addressable storage; Cryptography; Galois fields; Information theory; Length measurement; Linear feedback shift registers; Random sequences;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory, 2004. ISIT 2004. Proceedings. International Symposium on
  • Print_ISBN
    0-7803-8280-3
  • Type

    conf

  • DOI
    10.1109/ISIT.2004.1365159
  • Filename
    1365159
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2052816