Image Encryption Algorithm Based on Artificial Bee Colony Algorithm and Chaotic System

Author:

Zhou Yanqi1,Wang Erfu1ORCID,Song Xiaomeng1,Shi Mengna1

Affiliation:

1. Electrical Engineering College, Heilongjiang University, Harbin 150080, China

Abstract

This article proposes an image encryption algorithm based on a chaotic bit-plane decomposition and optimization algorithm of a crossover operator artificial bee colony algorithm. Firstly, use the SHA-256 hash algorithm to calculate the plaintext image’s hash value as the starting value of the fractional Lorenz hyperchaotic system after operation. Utilize the chaotic sequence to permutate plaintext image in a bit plane to obtain the scrambled image. Secondly, block the scrambled image into four subimages of equal size, and count the hash value of each row of each block by the SHA-256 hash algorithm as the starting value of the Sine-Tent-Logistic chaotic system. Use the obtained chaotic sequence to substitute the images. Then, stitch the four sub-block images to get the final encrypted image, and the population is obtained. Finally, use the information entropy of ciphertext image as the fitness function of the artificial bee colony algorithm based on a crossover operator. Select the ciphertext image with the best information entropy from the population as the optimal encrypted image, and then, return the position value of the best honey source meanwhile. The experimental simulation and security analysis indicate that the scheme has an excellent encryption effect and ability to oppose various general attacks.

Funder

Natural Science Foundation of Heilongjiang Province

Publisher

Hindawi Limited

Subject

Computer Networks and Communications,Information Systems

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

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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