• DocumentCode
    3527591
  • Title

    Reducing the Computation of the linear complexity of upv -periodic sequences

  • Author

    Jiang, Zheng-qing ; Zhu, Li-Yan

  • Author_Institution
    Sino-Korean Sch. of Multimedia design, Shanghai Univ. of Eng. Sci., Shanghai, China
  • Volume
    Part 2
  • fYear
    2011
  • fDate
    3-5 Sept. 2011
  • Firstpage
    1273
  • Lastpage
    1277
  • Abstract
    We present a fast algorithm that reduced the computation of the linear complexity of the upv -periodic 1 sequence under gcd (u, p) = 1 to the computation of maximum of some linear complexities of pv -periodic sequences over Fp. After combining with the Berlekamp-Massy algorithm or generalized Games-Chan algorithm, we could efficiently compute the linear complexity of pv -periodic sequence. Thus we present an efficient and attractive algorithm for calculating the linear complexity of upv -periodic sequences.
  • Keywords
    computational complexity; cryptography; polynomials; sequences; Berlekamp-Massy algorithm; generalized Games-Chan algorithm; linear complexity; minimal connection polynomial; pv -periodic sequences; stream ciphers; upv -periodic sequences; Algorithm design and analysis; Complexity theory; Cryptography; Finite element methods; Galois fields; Joints; Polynomials; Joint Linear Complexit; Linear Complexity; Stream Ciphers;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Industrial Engineering and Engineering Management (IE&EM), 2011 IEEE 18Th International Conference on
  • Conference_Location
    Changchun
  • Print_ISBN
    978-1-61284-446-6
  • Type

    conf

  • DOI
    10.1109/ICIEEM.2011.6035388
  • Filename
    6035388
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3527591