一种具有容错性的序列综合算法  

A Sequence Synthesis Algorithm with Error Tolerance

作　　者：郭涛[1] 陆佩忠[1] 

机构地区：[1]复旦大学计算机科学技术学院,上海200433

出　　处：《计算机工程》2014年第2期128-133,共6页Computer Engineering

摘　　要：线性递归序列的容错综合问题在流密码分析领域具有重要的理论分析与应用价值。利用伽罗华域上2个变元多项式??x,y?的齐次理想刻画齐次关键方程的解空间,通过齐次关键方程解决线性递归序列综合问题不但具有可行性,而且具有某些容错性质。为此,根据二元多项式齐次理想Gr?bner基算法,提出一种求解齐次关键方程的快速算法,并给出一个定理来论述算法实现序列综合的充分条件。通过实验仿真对该算法在不同的序列复杂度和误码率下的容错性能进行分析,结果表明,该算法的成功率与序列复杂度呈线性关系,在误码率为10–3的情况下,对于序列复杂度为65、序列长度为1 000的序列,成功率可达86.6%以上。The Synthesis of Linear Shift Register（LSR） with error tolerance is an important problem in the analysis of stream cipher. This paper constructs a homogenous key equation which is described by homogenous ideal of F [x, y]. It shows that the Homogenous key module equation can be used to solve the synthesis problem of the LSR sequence. By means of a fast computation of Grrbner basis of homogenous polynomial ideal with two variables, the paper finds an efficient algorithm to solve the Homogenous key module equation. It gives a theorem to show the error tolerance of the algorithm. Results show that the success rate of the algorithm has a linear relationship with the complexity of the sequence, for a sequence with length of 1 000 and complexity of 65, the success rate of the algorithm is up to 86.6% at an error code rate of 10-3.

关 键 词：序列综合 关键方程 BERLEKAMP-MASSEY算法 Gr6bner基 容错性能 

分 类 号：TP309[自动化与计算机技术—计算机系统结构]