{"title":"Cryptanalysis of a Chaos-based Stream Cipher","authors":"Bin Zhang, Chenhui Jin","doi":"10.1109/ICYCS.2008.136","DOIUrl":null,"url":null,"abstract":"In 2007, Fu Chong et al. proposed an improved chaos-based stream cipher. The secret key of Fu's cipher with 2158 key space size composes of 3 independent chaos initial states. In this paper, the security of Fu's chaotic cipher is investigated and the information leak of chaos map that we call preimage compressibility is discovered. We guess one chaos initial state and obtain two sampling quantified sequences which are generated by other two chaos initial states. Then based on the preimage compressibility of chaos map, an inversion and compression attack is proposed to recover the chaos initial state from sampling quantified sequence. The success probability of the whole attack is 1 and the computational complexity is just about 260.7. The memory complexity and data complexity can be negligible.","PeriodicalId":370660,"journal":{"name":"2008 The 9th International Conference for Young Computer Scientists","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","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.136","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6
Abstract
In 2007, Fu Chong et al. proposed an improved chaos-based stream cipher. The secret key of Fu's cipher with 2158 key space size composes of 3 independent chaos initial states. In this paper, the security of Fu's chaotic cipher is investigated and the information leak of chaos map that we call preimage compressibility is discovered. We guess one chaos initial state and obtain two sampling quantified sequences which are generated by other two chaos initial states. Then based on the preimage compressibility of chaos map, an inversion and compression attack is proposed to recover the chaos initial state from sampling quantified sequence. The success probability of the whole attack is 1 and the computational complexity is just about 260.7. The memory complexity and data complexity can be negligible.