首页> 外文会议>4th International Conference on Cryptology in India; Dec 8-10, 2003; New Delhi, India >Linear Complexity and Related Complexity Measures for Sequences
【24h】

Linear Complexity and Related Complexity Measures for Sequences

机译:序列的线性复杂度和相关复杂度测度

获取原文
获取原文并翻译 | 示例

摘要

We present a survey of recent work on the linear complexity, the linear complexity profile, and the k-error linear complexity of sequences and on the joint linear complexity of multisequences. We also establish a new enumeration theorem on multisequences and state several open problems. The material is of relevance for the assessment of keystreams in stream ciphers.
机译:我们对线性复杂度,线性复杂度分布图和k误差线性复杂度以及多序列联合线性复杂度的最新工作进行了概述。我们还建立了一个关于多序列的新的枚举定理,并陈述了几个未解决的问题。该材料与评估流密码中的关键流有关。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号