分割和打乱-利用魔方的递归图像打乱算法

Rahul Patanwadia, Ramchandra S. Mangrulkar
{"title":"分割和打乱-利用魔方的递归图像打乱算法","authors":"Rahul Patanwadia, Ramchandra S. Mangrulkar","doi":"10.1109/RTEICT52294.2021.9573949","DOIUrl":null,"url":null,"abstract":"Divide and Scramble - An image scrambling algorithm based on the Rubik's cube is presented in this paper. The strength and robustness of the algorithm are based on the number of permutations of the Rubik's cube and its simple yet chaos-inducing rotation methods. The algorithm uses a recursive approach that runs in linearithmic time. This makes the algorithm practical for real-time applications, which involve the concepts of cryptography. The algorithm begins by dividing the image into two halves and then, pixels from each half are combined to form a cube which is scrambled using the moves generated by a pseudo-random number generator function. The generated halves are further scrambled using the algorithm in a recursive manner. The scrambling algorithm is flexible enough to be paired up with any given diffusion, confusion, or substitution methods to obtain complex and secure encryption. Moreover, the pseudo-random number generator function used can also be replaced by other random number sequence generators like chaotic maps. The strength and robustness of the algorithm are backed by the obtained results from the experiments performed. Experimental results also show that the image quality is not compromised by the algorithm while resisting common crypto-attacks like differential and statistical attacks.","PeriodicalId":191410,"journal":{"name":"2021 International Conference on Recent Trends on Electronics, Information, Communication & Technology (RTEICT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Divide and Scramble - A Recursive Image Scrambling algorithm utilizing Rubik's Cube\",\"authors\":\"Rahul Patanwadia, Ramchandra S. Mangrulkar\",\"doi\":\"10.1109/RTEICT52294.2021.9573949\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Divide and Scramble - An image scrambling algorithm based on the Rubik's cube is presented in this paper. The strength and robustness of the algorithm are based on the number of permutations of the Rubik's cube and its simple yet chaos-inducing rotation methods. The algorithm uses a recursive approach that runs in linearithmic time. This makes the algorithm practical for real-time applications, which involve the concepts of cryptography. The algorithm begins by dividing the image into two halves and then, pixels from each half are combined to form a cube which is scrambled using the moves generated by a pseudo-random number generator function. The generated halves are further scrambled using the algorithm in a recursive manner. The scrambling algorithm is flexible enough to be paired up with any given diffusion, confusion, or substitution methods to obtain complex and secure encryption. Moreover, the pseudo-random number generator function used can also be replaced by other random number sequence generators like chaotic maps. The strength and robustness of the algorithm are backed by the obtained results from the experiments performed. Experimental results also show that the image quality is not compromised by the algorithm while resisting common crypto-attacks like differential and statistical attacks.\",\"PeriodicalId\":191410,\"journal\":{\"name\":\"2021 International Conference on Recent Trends on Electronics, Information, Communication & Technology (RTEICT)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-08-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 International Conference on Recent Trends on Electronics, Information, Communication & Technology (RTEICT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/RTEICT52294.2021.9573949\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 International Conference on Recent Trends on Electronics, Information, Communication & Technology (RTEICT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RTEICT52294.2021.9573949","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

摘要提出了一种基于魔方的图像置乱算法。该算法的强度和鲁棒性是基于魔方排列的数量及其简单但引起混乱的旋转方法。该算法使用线性时间内运行的递归方法。这使得该算法适用于涉及密码学概念的实时应用程序。该算法首先将图像分成两半,然后将每一半的像素组合成一个立方体,该立方体使用伪随机数生成函数生成的移动进行打乱。生成的一半将使用该算法以递归的方式进一步打乱。加扰算法具有足够的灵活性,可以与任何给定的扩散、混淆或替换方法配对,以获得复杂而安全的加密。此外,所使用的伪随机数生成器函数也可以被其他随机数序列生成器(如混沌映射)所取代。实验结果证明了该算法的强度和鲁棒性。实验结果还表明,该算法在抵抗差分攻击和统计攻击等常见加密攻击的同时,不会影响图像质量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Divide and Scramble - A Recursive Image Scrambling algorithm utilizing Rubik's Cube
Divide and Scramble - An image scrambling algorithm based on the Rubik's cube is presented in this paper. The strength and robustness of the algorithm are based on the number of permutations of the Rubik's cube and its simple yet chaos-inducing rotation methods. The algorithm uses a recursive approach that runs in linearithmic time. This makes the algorithm practical for real-time applications, which involve the concepts of cryptography. The algorithm begins by dividing the image into two halves and then, pixels from each half are combined to form a cube which is scrambled using the moves generated by a pseudo-random number generator function. The generated halves are further scrambled using the algorithm in a recursive manner. The scrambling algorithm is flexible enough to be paired up with any given diffusion, confusion, or substitution methods to obtain complex and secure encryption. Moreover, the pseudo-random number generator function used can also be replaced by other random number sequence generators like chaotic maps. The strength and robustness of the algorithm are backed by the obtained results from the experiments performed. Experimental results also show that the image quality is not compromised by the algorithm while resisting common crypto-attacks like differential and statistical attacks.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信