摘要
代数攻击算法XSL是域GF(2)上求解大规模的多元多项式方程组的有效算法,分析发现XSL中的T′算法不能达到其希望的结束条件Free=T或Free=T-1。给出T′算法的一个真实结束条件和2个变量选择原则,并在原T′算法的基础上增加概率算法和以较大概率估计变量取值。结果表明改进后的T′算法可以简化方程组求解。
The XSL algorithm is a method for solving systems of multivariate polynomial equations based on the linearization method on GF(2),and the T ' method is the final stage of the XSL algorithm before linearization.Through analysis revealed that the T ' algorithm can not achieve its desired end condition Free = T or Free=T-1.In orde to solve the problem,a real end condition and two variable selection principle was proposed for T′ algorithm.Based on probabilistic algorithms and variable values greater probability estimation method to improve performance of the original T 'algorithm.The results show that the improved T 'algorithm can simplify the equations.
出处
《通信学报》
EI
CSCD
北大核心
2011年第9期82-87,共6页
Journal on Communications
基金
浙江省自然科学基金资助项目(Z1101048)~~