Periodic Sequences with very Large 1-Error Linear Complexity over Fq
DOI:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    Linear complexity is an important design index for assessing the cryptographic strength of a sequence.Pseudorandom sequences with large linear complexity and large k-error linear complexity is a hot topic in cryptography and communications. Niederreiter found many such periodic sequences over Fq firstly. In this paper,the authors construct some periodic sequences over Fq with very large 1-error linear complexity by the GDFT of a periodic sequence. The result is much better than the known ones.

    Reference
    Related
    Cited by
Get Citation

胡红钢,冯登国.Fq上具有极大1-error线性复杂度的周期序列.软件学报,2005,16(5):940-945

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:June 23,2003
  • Revised:November 10,2003
  • Adopted:
  • Online:
  • Published:
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063