{"title":"BES的XSL分析","authors":"Buyun Qu, Lianhao Liu","doi":"10.1109/ICYCS.2008.367","DOIUrl":null,"url":null,"abstract":"Since the proposal of the XSL cryptanalysis and the construction of the big encryption system (BES), the potential for algebraic attacks against the advanced encryption system (AES), especially over GF(28), has attracted a lot of attention from the cryptographic community. This paper presents an analysis of the compact XSL attack applied to the BES with the key schedule involved. We introduce a new strategy to reduce the number of S-boxes which is used to multiply the equations derived from the cipher linear layer. Then the scale of the expanded equation system can be reduced and it, in theory, leads to a better result than exhaustive key search: for BES corresponding to 128-bit key size AES, the complexity estimate is about 297.","PeriodicalId":370660,"journal":{"name":"2008 The 9th International Conference for Young Computer Scientists","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"An XSL Analysis on BES\",\"authors\":\"Buyun Qu, Lianhao Liu\",\"doi\":\"10.1109/ICYCS.2008.367\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Since the proposal of the XSL cryptanalysis and the construction of the big encryption system (BES), the potential for algebraic attacks against the advanced encryption system (AES), especially over GF(28), has attracted a lot of attention from the cryptographic community. This paper presents an analysis of the compact XSL attack applied to the BES with the key schedule involved. We introduce a new strategy to reduce the number of S-boxes which is used to multiply the equations derived from the cipher linear layer. Then the scale of the expanded equation system can be reduced and it, in theory, leads to a better result than exhaustive key search: for BES corresponding to 128-bit key size AES, the complexity estimate is about 297.\",\"PeriodicalId\":370660,\"journal\":{\"name\":\"2008 The 9th International Conference for Young Computer Scientists\",\"volume\":\"14 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-11-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 The 9th International Conference for Young Computer Scientists\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICYCS.2008.367\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 The 9th International Conference for Young Computer Scientists","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICYCS.2008.367","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Since the proposal of the XSL cryptanalysis and the construction of the big encryption system (BES), the potential for algebraic attacks against the advanced encryption system (AES), especially over GF(28), has attracted a lot of attention from the cryptographic community. This paper presents an analysis of the compact XSL attack applied to the BES with the key schedule involved. We introduce a new strategy to reduce the number of S-boxes which is used to multiply the equations derived from the cipher linear layer. Then the scale of the expanded equation system can be reduced and it, in theory, leads to a better result than exhaustive key search: for BES corresponding to 128-bit key size AES, the complexity estimate is about 297.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
