Advanced Search
Volume 24 Issue 11
Nov.  2002
Turn off MathJax
Article Contents
Wang Shangping, Wang Yumin. The eigenvector representation of LFSR\s output sequence[J]. Journal of Electronics & Information Technology, 2002, 24(11): 1608-1613.
Citation: Wang Shangping, Wang Yumin. The eigenvector representation of LFSR\s output sequence[J]. Journal of Electronics & Information Technology, 2002, 24(11): 1608-1613.

The eigenvector representation of LFSR\s output sequence

  • Received Date: 2000-12-06
  • Rev Recd Date: 2002-05-11
  • Publish Date: 2002-11-19
  • By using coefficient matrix representation of LFSR s output sequences and analyzing the eigenvector representation of the coefficient matrix, the output sequences of LFSR is expressed, where the coefficients completely rely on the initial input values of the LFSR and the roots of the reciprocal polynomial of LFSR s minimum polynomial. The result is more explicit than the former result.
  • loading
  • 丁存生,肖国镇,流密码学极其应用,北京,国防工业出版社,1994,39-78.[2]R.A. Rueppel, Analysis and Design of Stream Cipher[M], Berlin, Springer-Verlag, 1986, 33-67.[3]R.A. Rueppel, O. J. Staffelbach, Product of linear recurring sequences with maximum complexity,IEEE Trans. on IT, 1987, 33(1), 121-134.[4]M.J.B. Robshaw, On evaluating the linear complexity of a sequence of least period 2n.[J]. Design Codes and Cryptography.1994,4:263-[5]王育民,刘建伟.通信网的安全-理论与技术,西安,西安电子科技大学出版社,1999,230-281.
  • 加载中

Catalog

    通讯作者: 陈斌, bchen63@163.com
    • 1. 

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索

    Article Metrics

    Article views (2440) PDF downloads(464) Cited by()
    Proportional views
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return