• DocumentCode
    15000
  • Title

    Sequences With High Nonlinear Complexity

  • Author

    Niederreiter, Harald ; Chaoping Xing

  • Author_Institution
    Johann Radon Inst. for Comput. & Appl. Math., Linz, Austria
  • Volume
    60
  • Issue
    10
  • fYear
    2014
  • fDate
    Oct. 2014
  • Firstpage
    6696
  • Lastpage
    6701
  • Abstract
    We improve lower bounds on the k th-order nonlinear complexity of pseudorandom sequences over finite fields, including explicit inversive sequences and sequences obtained from Hermitian function fields, and we establish a probabilistic result on the behavior of the k th-order nonlinear complexity of random sequences over finite fields.
  • Keywords
    cryptography; probability; random sequences; Hermitian function fields; explicit inversive sequences; finite fields; maximum order complexity; nonlinear complexity; pseudorandom sequences; Complexity theory; Cryptography; Educational institutions; Generators; Polynomials; Probabilistic logic; Random sequences; Linear complexity; maximum-order complexity; nonlinear complexity; pseudorandom sequence;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

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