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!
|
| _version_ | 1841537789389176832 |
|---|---|
| author | GUO Wen-ping 1 AN Jin-liang2 |
| author_facet | GUO Wen-ping 1 AN Jin-liang2 |
| author_sort | GUO Wen-ping 1 |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-67ee590f1243416488d93faacf3900a0 |
| institution | Kabale University |
| issn | 1000-436X |
| language | zho |
| publishDate | 2011-01-01 |
| publisher | Editorial Department of Journal on Communications |
| record_format | Article |
| series | Tongxin xuebao |
| spelling | doaj-art-67ee590f1243416488d93faacf3900a02025-01-14T08:23:22ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2011-01-0132828774418193Performance research of the T′ algorithm over GF（2）GUO Wen-ping 1AN Jin-liang2The 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.http://www.joconline.com.cn/zh/article/74418193/algebraic attacksXL algorithmXSL algorithmT′ algorithm |
| spellingShingle | GUO Wen-ping 1 AN Jin-liang2 Performance research of the T′ algorithm over GF（2） Tongxin xuebao algebraic attacks XL algorithm XSL algorithm T′ algorithm |
| title | Performance research of the T′ algorithm over GF（2） |
| title_full | Performance research of the T′ algorithm over GF（2） |
| title_fullStr | Performance research of the T′ algorithm over GF（2） |
| title_full_unstemmed | Performance research of the T′ algorithm over GF（2） |
| title_short | Performance research of the T′ algorithm over GF（2） |
| title_sort | performance research of the t algorithm over gf 2 |
| topic | algebraic attacks XL algorithm XSL algorithm T′ algorithm |
| url | http://www.joconline.com.cn/zh/article/74418193/ |
| work_keys_str_mv | AT guowenping1 performanceresearchofthetalgorithmovergf2 AT anjinliang2 performanceresearchofthetalgorithmovergf2 |