基于混沌的流密码的密码分析

Bin Zhang, Chenhui Jin
{"title":"基于混沌的流密码的密码分析","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":"{\"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}","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

摘要

2007年,付冲等人提出了一种改进的基于混沌的流密码。密钥空间大小为2158的傅密码的密钥由3个独立的混沌初始状态组成。本文研究了傅氏混沌密码的安全性,发现了混沌映射的信息泄漏,我们称之为原象压缩性。我们猜测一个混沌初始状态,得到由另外两个混沌初始状态产生的两个采样量化序列。然后,基于混沌映射的预像可压缩性,提出了一种反演压缩攻击,从采样量化序列中恢复混沌初始状态。整个攻击的成功概率为1,计算复杂度仅为260.7左右。内存复杂度和数据复杂度可以忽略不计。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Cryptanalysis of a Chaos-based Stream Cipher
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信