一种基于Mandelbrot集的图像加密算法

Yuanyuan Sun, Rui Kong, Xing-yuan Wang, Lian-cheng Bi
{"title":"一种基于Mandelbrot集的图像加密算法","authors":"Yuanyuan Sun, Rui Kong, Xing-yuan Wang, Lian-cheng Bi","doi":"10.1109/IWCFTA.2010.70","DOIUrl":null,"url":null,"abstract":"As an important field in information security, image encryption algorithm has been a research focus. At the same time there are few works on fractal set as the encryption key among various encryption algorithms. In the paper, Mandelbrot set (abbreviated as M set) and the Hilbert transformation are utilized to generate the random key. Since M set can be iterated from only a few parameters, it can reduce the storage space greatly. In addition, the infinite boundaries of the M set and the Hilbert transformation enhance the randomness of the key. Experimental results show that even the slight disturbance of the parameters can change the key dramatically. Moreover, the algorithm needs small space for key storage and the real-time encryption can be achieved.","PeriodicalId":157339,"journal":{"name":"2010 International Workshop on Chaos-Fractal Theories and Applications","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"17","resultStr":"{\"title\":\"An Image Encryption Algorithm Utilizing Mandelbrot Set\",\"authors\":\"Yuanyuan Sun, Rui Kong, Xing-yuan Wang, Lian-cheng Bi\",\"doi\":\"10.1109/IWCFTA.2010.70\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"As an important field in information security, image encryption algorithm has been a research focus. At the same time there are few works on fractal set as the encryption key among various encryption algorithms. In the paper, Mandelbrot set (abbreviated as M set) and the Hilbert transformation are utilized to generate the random key. Since M set can be iterated from only a few parameters, it can reduce the storage space greatly. In addition, the infinite boundaries of the M set and the Hilbert transformation enhance the randomness of the key. Experimental results show that even the slight disturbance of the parameters can change the key dramatically. Moreover, the algorithm needs small space for key storage and the real-time encryption can be achieved.\",\"PeriodicalId\":157339,\"journal\":{\"name\":\"2010 International Workshop on Chaos-Fractal Theories and Applications\",\"volume\":\"13 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-10-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"17\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 International Workshop on Chaos-Fractal Theories and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IWCFTA.2010.70\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 International Workshop on Chaos-Fractal Theories and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IWCFTA.2010.70","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 17

摘要

图像加密算法作为信息安全的一个重要领域,一直是研究的热点。同时,在各种加密算法中,将分形集作为加密密钥的研究很少。本文利用Mandelbrot集合(简称M集合)和Hilbert变换生成随机密钥。由于M集合可以只从几个参数进行迭代,因此可以大大减少存储空间。另外,M集的无穷边界和Hilbert变换增强了密钥的随机性。实验结果表明,即使参数的微小扰动也能使键发生显著变化。该算法对密钥存储空间要求小,能够实现实时加密。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An Image Encryption Algorithm Utilizing Mandelbrot Set
As an important field in information security, image encryption algorithm has been a research focus. At the same time there are few works on fractal set as the encryption key among various encryption algorithms. In the paper, Mandelbrot set (abbreviated as M set) and the Hilbert transformation are utilized to generate the random key. Since M set can be iterated from only a few parameters, it can reduce the storage space greatly. In addition, the infinite boundaries of the M set and the Hilbert transformation enhance the randomness of the key. Experimental results show that even the slight disturbance of the parameters can change the key dramatically. Moreover, the algorithm needs small space for key storage and the real-time encryption can be achieved.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信