中国科学技术大学学报 ›› 2018, Vol. 48 ›› Issue (2): 105-110.DOI: 10.3969/j.issn.0253-2778.2018.02.003

• 论著 • 上一篇    下一篇

一个计算指数周期序列的所有跃点的算法

唐淼,王菊香   

  1. 1.安徽农业大学应用数学系, 安徽合肥 230036;2.安徽建筑大学数理学院, 安徽合肥 230601
  • 收稿日期:2016-08-24 修回日期:2017-11-22 出版日期:2018-02-28 发布日期:2018-02-28
  • 通讯作者: 唐淼
  • 作者简介:唐淼(通讯作者),男,1981年生,硕士/副教授. 研究方向:编码与密码. E-mail: tangmiao@ahau.edu.cn
  • 基金资助:
    安徽省高校自然科学研究项目重点项目(KJ2017A136) , 安徽省高校优秀青年人才支持计划重点项目(gxyqZD2016032), 安徽省教育厅自然科学基金一般项目(KJ2015JD18)资助.

An algorithm for computing all the critical points of exponent periodic sequences

TANG Miao, WANG Juxiang   

  1. 1. Department of Applied Mathematics, Anhui Agricultural University, Hefei 230036, China;
    2. School of Mathematics and Physics, Anhui Jianzhu University, Hefei 230601, China)
  • Received:2016-08-24 Revised:2017-11-22 Online:2018-02-28 Published:2018-02-28

摘要: 周期序列的k错线性复杂度是衡量流密码系统安全性能的一个重要指标,k错线性复杂度的值随着k值的增加呈下降趋势,其中发生严格下降的点称为跃点.这里关注有限域GF(pm)上的pn周期序列,p是任意素数,讨论了该类序列的k错线性复杂度的性质,同时给出了一个算法:对于任意给定的序列,计算出其包含的所有跃点.

关键词: 流密码, 周期序列, k错线性复杂度, 跃点

Abstract: The k-error linear complexity of periodic sequences is an important security indice of stream cipher systems. The k-error linear complexity decreases as the number of errors k increases, that the critical points are those where a decrease occurs in the k-error linear complexity. The pn periodic sequences over the finite field GF(pm) were focused upon, where p is a prime. Some properties of the k-error linear complexity were discussed, and an algorithm was presented for computing all the critical points for a given sequence.

Key words: stream cipher, periodic sequence;k-error linear complexity, critical point

中图分类号: