摘要
周期序列的k错线性复杂度是衡量流密码系统安全性能的一个重要指标,k错线性复杂度的值随着k值的增加呈下降趋势,其中发生严格下降的点称为跃点.这里关注有限域GF(pm)上的pn周期序列,p是任意素数,讨论了该类序列的k错线性复杂度的性质,同时给出了一个算法:对于任意给定的序列,计算出其包含的所有跃点.
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(p^m)were focused upon,where pis 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.
作者
唐淼
王菊香
TANG Miao;WANG Juxiang(Department of Applied Mathematics, Anhui Agricultural University, Hefei 230036, China;School of Mathematics and Physics, Anhui J ianzhu University, Hefei 230601, China)
基金
安徽省高校自然科学研究项目重点项目(KJ2017A136)
安徽省高校优秀青年人才支持计划重点项目(gxyqZD2016032)
安徽省教育厅自然科学基金一般项目(KJ2015JD18)资助
关键词
流密码
周期序列
K错线性复杂度
跃点
stream cipher
periodic sequence
k-error linear complexity
critical point