Name
Abstract | ||
|---|---|---|
The XSL attack when applied on BES-128 has been shown to have an attack complexity of 2100, which is faster than exhaustive search. However at FSE 2007, Lim and Khoo analyzed the eprint XSL attack on BES and showed that the attack complexity should be 2401. Later at IEEE-YCS 2008, Qu and Liu counter-proposed that the compact XSL attack on BES-128 works and has complexity 297. In this paper, we point out some errors in the attack of Qu and Liu. We also show that the complexity of the compact XSL attack on BES-128 is at least 2209.15. At Indocrypt 2007, Ji and Hu claimed that the eprint XSL attack on ESMS4 has complexity 277. By the same method we used to analyze BES, we also show that the complexity of compact XSL attack on ESMS4 is at least 2216.58. Our analysis adapts the approach of Lim and Khoo to the compact XSL attack, and improves on it by considering the T *** method that grows the number of equations. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1007/978-3-642-10433-6_8 | CANS |
Keywords | Field | DocType |
xsl attack,exhaustive search,eprint xsl attack,attack complexity,compact xsl attack,bes-128 work | Eprint,Brute-force search,Computer science,Computer security,Theoretical computer science,XSL attack | Conference |
Volume | ISSN | Citations |
5888 | 0302-9743 | 5 |
PageRank | References | Authors |
0.45 | 7 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jiali Choy | 1 | 44 | 4.10 |
| Huihui Yap | 2 | 83 | 5.76 |
| Khoongming Khoo | 3 | 250 | 23.29 |