Lower bounds on error complexity measures for periodic LFSR and FCSR sequences

著录项

• 来源
  《Cryptography and Communications》 |2009年第1期|95-116|共22页
• 作者

  Ramakanth Kavuluru; Andrew Klapper;

  展开▼
• 作者单位

  Department of Computer Science University of Kentucky Lexington KY 40506 USA;

  Department of Computer Science University of Kentucky Lexington KY 40506 USA;

  展开▼
• 收录信息
• 原文格式 PDF
• 正文语种 eng
• 中图分类
• 关键词

  LFSR; FCSR; Linear complexity; N-adic complexity; k-error complexity; 94A55;

  机译：LFSR;FCSR;线性复杂度;N-adic复杂度;k误差复杂度;94A55;