【24h】

An Image Encryption Algorithm Utilizing Mandelbrot Set

机译:利用Mandelbrot集的图像加密算法

获取原文

摘要

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.
机译:图像加密算法作为信息安全的重要领域,一直是研究的热点。同时,在各种加密算法中,关于分形集作为加密密钥的工作很少。在本文中,Mandelbrot集(缩写为M集)和希尔伯特变换被用来生成随机密钥。由于M set可以仅通过几个参数进行迭代,因此可以大大减少存储空间。此外,M集的无限边界和希尔伯特变换增强了密钥的随机性。实验结果表明,即使参数受到轻微干扰也可以显着改变密钥。此外,该算法需要较小的空间来存储密钥,并且可以实现实时加密。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号