Performance research of the T′ algorithm over GF（2）
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...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2011-01-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/74418193/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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. |
|---|---|
| ISSN: | 1000-436X |