| All in the XL Family: Theory and Practice | |
|---|---|
| 學年 | 93 |
| 學期 | 1 |
| 發表日期 | 2004-12-01 |
| 作品名稱 | All in the XL Family: Theory and Practice |
| 作品名稱（其他語言） | |
| 著者 | 楊柏因; 陳君明 |
| 作品所屬單位 | 淡江大學數學學系 |
| 出版者 | 韓國密碼學會 |
| 會議名稱 | 第七屆國際資訊安全與密碼學研討會 |
| 會議地點 | 漢城，韓國 |
| 摘要 | The XL (EXTENDED LINEARIZATION) equation-solving algorithm belongs to the same extended family as the advanced Gröbner Bases methods F 4 /F 5 . XL and its relatives may be used as direct attacks against multivariate Public-Key Cryptosystems and as final stages for many “algebraic cryptanalysis” used today. We analyze the applicability and performance of XL and its relatives, particularly for generic systems of equations over medium-sized finite fields. In examining the extended family of Gröbner Bases and XL from theoretical, empirical and practical viewpoints, we add to the general understanding of equation-solving. Moreover, we give rigorous conditions for the successful termination of XL, Gröbner Bases methods and relatives. Thus we have a better grasp of how such algebraic attacks should be applied. We also compute revised security estimates for multivariate cryptosystems. For example, the schemes SFLASHv2 and HFE Challenge 2 are shown to be unbroken by XL variants. |
| 關鍵字 | algebraic analysis;finite field;Gröbner Bases;multivariate quadratics;multivariate cryptography;XL |
| 語言 | en |
| 收錄於 | |
| 會議性質 | 國際 |
| 校內研討會地點 | 無 |
| 研討會時間 | 20041201~20041201 |
| 通訊作者 | |
| 國別 | TWN |
| 公開徵稿 | |
| 出版型式 | |
| 出處 | |
| 相關連結 |
機構典藏連結 ( http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/58910 ) |
GoogleAnalytics