Image Encryption Algorithm Based on a Novel Wide-Range Discrete Hyperchaotic Map

Author:

Zhong HuiyanORCID,Li GuodongORCID,Xu XiangliangORCID,Song XiaomingORCID

Abstract

Existing hyperchaotic systems suffer from a small parameter range and small key space. Therefore, we propose herein a novel wide-range discrete hyperchaotic map(3D-SCC) based on the mathematical model of the Sine map. Dynamic numerical analysis shows that this map has a wide-range of parameters, high sensitive, high sensitivity of sequences and good ergodicity, which proves that the system is well suited to the field of communication encryption. Moreover, this paper proposes an image encryption algorithm based on a dynamic cycle shift scramble algorithm and image-sensitive function. First, the image feature is extracted by the image-sensitive function to input into the chaos map. Then, the plaintext image is decomposed by an integer wavelet, and the low-frequency part is scrambled by a dynamic cyclic shifting algorithm. The shuffled low-frequency part and high-frequency parts are reconstructed by wavelet, and the chaotic matrix image is bitwise XOR with it to obtain the final ciphertext. The experimental results show that the average NPCR is 99.6024%, the average UACI is 33.4630%, and the average local Shannon entropy is 7.9029, indicating that the statistical properties of the ciphertext are closer to the ideal value. The anti-attack test shows that the algorithm can effectively resist cutting attacks and noise attacks. Therefore, the algorithm has great application value in the field of image encryption.

Funder

Natural Science Foundation of Guangxi province

Guilin University of Electronic Technology Fund

Publisher

MDPI AG

Subject

General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3