|標題：All in the XL family : theory and practice|
|作品名稱||All in the XL family : theory and practice|
|作品名稱（其他語言）||XL (延伸線性化) 類方法的理論和實際的探討|
|著者||Yang, Bo-yin; Chen, Jiun-ming|
|出版者||Berlin Heidelberg : Springer-Verlag GmbH|
|著錄名稱、卷期、頁數||Lecture Notes in Computer Science 3506, pp.67-86|
|摘要||The XL (eXtended Linearization) equation-solving algorithm belongs to the same extended family as the advanced Gröbner Bases methods F4/F5. 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|