| 摘要: |
| 置乱算法,即鲍位置移动算法简单、速度快，目前在图像和多媒体流加密中被广泛使用．但是，其在已知明文的攻击下是脆弱的．通过分析纯位置加密算法的这一弱点，给出了一种有效的破解算法．首先，通过引入遍历矩阵，将所有的纯位置移动算法统一在同一框架中；其次，利用概率统计和代数学的有关知识，从理论上验证了其破解概率；然后，通过定叉模糊遍历矩阵和其相关的末交、清晰化等运算，成功的给出了一种非常有效的破解算法．最后通过编程试验，证实谊破解算法的效果令人非常满意． |
| 关键词: 破解：置乱 图像加密 模糊 |
| DOI： |
| 分类号: |
| 基金项目:Supported bytheNationalNatural Science Foundation of China under Grant N0.60302012(国家自然科学基金);the National Reseatoh Foundation of Higher Education of Zhejiang Province under Grant No.20030502(浙江省教育厅基金). |
|
| Decryption of Scramble Algorithms |
|
ZHAO Yi-Ming,ZHAO Xiao-Yu,GONG Song-Chun
|
| Abstract: |
| Scramble algorithms，which are also called pure-position permutation algorithms，are commonly used as an image ancryption，are investigated in this paper．Unfortunately, they are frail under known-text attack．According to the weakness of pure position permutation algorithm,We put forward an effective decryption algorithm for aIl pure-position permutation algorithms．First,a summary of the pure position permutation image encryption algorithms is given by introducing the concept ofergodic nieces．Secondly,by using probability theory and algebra knowledge，the declyption probabilit：of pure-position permutation algorithms is verified theoretically． Then，by defining operation system of fuzzy ergodic matrices，we improve a specific decryption algorithm．Finally some simulation results are shown. |
| Key words: decryption scramble image encryption fuzzy |
