An algorithm based on 6D fractional order hyperchaotic system and knight tour algorithm to encrypt image

Author:

He ChenchenORCID,Chen ZhongORCID,Wang LujieORCID,Wu XimeiORCID,Liu TongzheORCID,Long BofengORCID

Abstract

Abstract The security guarantee of data transmission is becoming more crucial as the frequency of information interchange rises. Ensuring the security of images is essential since they serve as a vital transmission medium. This research suggests an image encryption method that combines the knight tour algorithm with a 6D fractional order hyperchaotic system. First, chaotic sequences are produced using a fractional order hyperchaotic system, which is then utilized to index order and jumble the entire image. To retrieve the image after the second scrambling, choose the knight tour beginning point and run ten rounds of knight tour algorithms on the scrambled image. Thirdly, to maximize the efficiency of picture encryption, employ diffusion methods. The outcomes of the imaging experiment were lastly tested and assessed. The security of the image can be successfully guaranteed by a high-dimensional fractional order hyperchaotic system. This is because its high dimensionality gives it a larger key space than the low dimensional system. This is why it can resist attacks more effectively. After a series of evaluation experiments, it is obvious that this encryption scheme has good encryption performance.

Funder

Scientific Research Fund of Hunan Provincial Education Department

Science and Technology Innovation Program of Hunan Province

Publisher

IOP Publishing

Cited by 2 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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