Robust Image Encryption Based on Double Hyper Chaotic Rabinovich System

Huda H. Alsaabri, Saad S. Hreshee
{"title":"Robust Image Encryption Based on Double Hyper Chaotic Rabinovich System","authors":"Huda H. Alsaabri, Saad S. Hreshee","doi":"10.1109/ICCITM53167.2021.9677722","DOIUrl":null,"url":null,"abstract":"an essential characteristic of chaotic systems is the difficulty in predicting the path of the chaotic time series and the size of the keyspace, which is very large compared to other encryption methods. This paper presents a new image encryption technique depending on a random bitstream generation method through a double Rabinovich hyperchaotic system. The proposed algorithm (Hyper Chaotic Rabinovich System (HCRS)) has been achieved in several ways. Each technique was examined in balanced and delay environments. Then an XOR operation will be done between the bits with the same index of the original image bits and the generated bits to obtain the encrypted image. The HCRS results showed that the balance in random bits between Zeros and Ones are equal in all proposed methods. The Pick Signal to Noise Ratio (PSNR) between the original and the encrypted images is (8.6262). The second significant result in this paper is that the keyspace is very large, more potent than 10ˆ288.","PeriodicalId":406104,"journal":{"name":"2021 7th International Conference on Contemporary Information Technology and Mathematics (ICCITM)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 7th International Conference on Contemporary Information Technology and Mathematics (ICCITM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCITM53167.2021.9677722","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

an essential characteristic of chaotic systems is the difficulty in predicting the path of the chaotic time series and the size of the keyspace, which is very large compared to other encryption methods. This paper presents a new image encryption technique depending on a random bitstream generation method through a double Rabinovich hyperchaotic system. The proposed algorithm (Hyper Chaotic Rabinovich System (HCRS)) has been achieved in several ways. Each technique was examined in balanced and delay environments. Then an XOR operation will be done between the bits with the same index of the original image bits and the generated bits to obtain the encrypted image. The HCRS results showed that the balance in random bits between Zeros and Ones are equal in all proposed methods. The Pick Signal to Noise Ratio (PSNR) between the original and the encrypted images is (8.6262). The second significant result in this paper is that the keyspace is very large, more potent than 10ˆ288.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于双超混沌Rabinovich系统的鲁棒图像加密
混沌系统的一个本质特征是难以预测混沌时间序列的路径和密钥空间的大小,这与其他加密方法相比是非常大的。通过双Rabinovich超混沌系统,提出了一种基于随机比特流生成方法的图像加密新技术。提出的算法(超混沌拉宾诺维奇系统(HCRS))有几种实现方法。每种技术都在平衡和延迟环境中进行了测试。然后在原始图像位与生成的位具有相同索引的位之间进行异或运算,得到加密后的图像。HCRS结果表明,在所有方法中,0和1之间的随机比特的平衡是相等的。原始图像和加密图像之间的拾取信噪比(PSNR)为(8.6262)。本文的第二个重要结果是键空间非常大,比10 * 288更有效。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Integration of Big Data, IoT and Cloud Computing Numerical Solution of Initial Value Problems of Time-Fractional Order via a Novel Fractional 4-Stage Runge-Kutta Method Multiclass Model for Quality of Service Using Machine Learning and Cloud Computing Study of the Factors Affecting the Incidence of COVID-19 Infection Using an Accelerrated Weibull Regression Model Contagious Patient Tracking Application Spotlight: Privacy and Security Rights
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1