基于旋转和移位的扩散函数分析

IF 0.3 4区 工程技术 Q4 COMPUTER SCIENCE, THEORY & METHODS
Arvind Kumar, P. Mishra, O. Ojjela
{"title":"基于旋转和移位的扩散函数分析","authors":"Arvind Kumar, P. Mishra, O. Ojjela","doi":"10.1080/01611194.2022.2046660","DOIUrl":null,"url":null,"abstract":"Abstract ‘Rotation and shift’ based diffusion functions are used in modern ciphers especially in ARX (Addition, Rotation, and XOR) based designs. They are preferred over other alternatives as they are efficient and lightweight. Usually, such diffusion functions map an n-bit block to another n-bit block. One of the requirements for an n-bit to n-bit diffusion function is that, it should be invertible. In this paper, we present mathematical models for different classes of ‘rotation and shift’ based diffusion functions and explore their invertibility. We derive sufficient conditions under which diffusion functions of these classes are invertible.","PeriodicalId":55202,"journal":{"name":"Cryptologia","volume":"47 1","pages":"419 - 435"},"PeriodicalIF":0.3000,"publicationDate":"2022-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Analysis of rotation and shift based diffusion functions\",\"authors\":\"Arvind Kumar, P. Mishra, O. Ojjela\",\"doi\":\"10.1080/01611194.2022.2046660\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract ‘Rotation and shift’ based diffusion functions are used in modern ciphers especially in ARX (Addition, Rotation, and XOR) based designs. They are preferred over other alternatives as they are efficient and lightweight. Usually, such diffusion functions map an n-bit block to another n-bit block. One of the requirements for an n-bit to n-bit diffusion function is that, it should be invertible. In this paper, we present mathematical models for different classes of ‘rotation and shift’ based diffusion functions and explore their invertibility. We derive sufficient conditions under which diffusion functions of these classes are invertible.\",\"PeriodicalId\":55202,\"journal\":{\"name\":\"Cryptologia\",\"volume\":\"47 1\",\"pages\":\"419 - 435\"},\"PeriodicalIF\":0.3000,\"publicationDate\":\"2022-05-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Cryptologia\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://doi.org/10.1080/01611194.2022.2046660\",\"RegionNum\":4,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Cryptologia","FirstCategoryId":"5","ListUrlMain":"https://doi.org/10.1080/01611194.2022.2046660","RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

摘要

基于“旋转和移位”的扩散函数用于现代密码中,特别是基于ARX(加法、旋转和异或)的设计。它们比其他替代品更受欢迎,因为它们效率高、重量轻。通常,这样的扩散函数将一个n位块映射到另一个n位块。一个n位到n位的扩散函数的要求之一是,它应该是可逆的。本文给出了不同类型的“旋转和移位”扩散函数的数学模型,并探讨了它们的可逆性。给出了这类扩散函数可逆的充分条件。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Analysis of rotation and shift based diffusion functions
Abstract ‘Rotation and shift’ based diffusion functions are used in modern ciphers especially in ARX (Addition, Rotation, and XOR) based designs. They are preferred over other alternatives as they are efficient and lightweight. Usually, such diffusion functions map an n-bit block to another n-bit block. One of the requirements for an n-bit to n-bit diffusion function is that, it should be invertible. In this paper, we present mathematical models for different classes of ‘rotation and shift’ based diffusion functions and explore their invertibility. We derive sufficient conditions under which diffusion functions of these classes are invertible.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Cryptologia
Cryptologia 工程技术-计算机:理论方法
自引率
33.30%
发文量
31
审稿时长
24 months
期刊介绍: Cryptologia is the only scholarly journal in the world dealing with the history, the technology, and the effect of the most important form of intelligence in the world today - communications intelligence. It fosters the study of all aspects of cryptology -- technical as well as historical and cultural. The journal"s articles have broken many new paths in intelligence history. They have told for the first time how a special agency prepared information from codebreaking for President Roosevelt, have described the ciphers of Lewis Carroll, revealed details of Hermann Goering"s wiretapping agency, published memoirs - written for it -- of some World War II American codebreakers, disclosed how American codebreaking affected the structure of the United Nations.
×
引用
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学术文献互助群
群 号:481959085
Book学术官方微信