提高电力系统信息安全:Saturnin密码算法分析

Ziqing Lin, B. Hu, Xiaojuan Zhang, Yayun Zhu, Jing-yi Cao, Liang Zhang, Yuan Fang
{"title":"提高电力系统信息安全:Saturnin密码算法分析","authors":"Ziqing Lin, B. Hu, Xiaojuan Zhang, Yayun Zhu, Jing-yi Cao, Liang Zhang, Yuan Fang","doi":"10.1109/AINIT59027.2023.10212614","DOIUrl":null,"url":null,"abstract":"New power systems require efficient and secure communication technologies to facilitate information exchange between various devices and systems. Among these, encryption technology is key to ensuring communication security. The lightweight block cipher algorithm, Saturnin, is similar to the AES algorithm and maintains good security even in resource-limited environments. Therefore, it can be applied to various devices in the power system, such as smart meters, sensors, controllers, etc. An impossible differential analysis was conducted on the Saturnin algorithm to identify potential security vulnerabilities, thereby enhancing the security of the power system. Firstly, based on the structural characteristics of the Saturnin algorithm, sufficient conditions for the 3.5-round impossible differential distinguisher of the Saturnin algorithm were proposed and proven. Using these sufficient conditions, 64 distinguishers can be quickly constructed and divided into four categories. Secondly, these four categories of distinguishers can be extended forward by two rounds to obtain four attack paths. These four attack paths not only have the same plaintext structure but also have a large number of common key bits. By utilizing these two characteristics, the complexity of the attack scheme can be improved. Combining early plaintext death analysis techniques, a 5.5-round impossible differential attack scheme for the Saturnin algorithm was proposed. The data, storage, and time complexity are 2176.88 chosen plaintexts, 2143.88 algorithm scale, and 2176.91 times 5.5-round encryption respectively. This is currently a visible impossible differential attack scheme against the Saturnin algorithm.","PeriodicalId":276778,"journal":{"name":"2023 4th International Seminar on Artificial Intelligence, Networking and Information Technology (AINIT)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Improving Power System Information Security: Analysis of the Saturnin Cipher Algorithm\",\"authors\":\"Ziqing Lin, B. Hu, Xiaojuan Zhang, Yayun Zhu, Jing-yi Cao, Liang Zhang, Yuan Fang\",\"doi\":\"10.1109/AINIT59027.2023.10212614\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"New power systems require efficient and secure communication technologies to facilitate information exchange between various devices and systems. Among these, encryption technology is key to ensuring communication security. The lightweight block cipher algorithm, Saturnin, is similar to the AES algorithm and maintains good security even in resource-limited environments. Therefore, it can be applied to various devices in the power system, such as smart meters, sensors, controllers, etc. An impossible differential analysis was conducted on the Saturnin algorithm to identify potential security vulnerabilities, thereby enhancing the security of the power system. Firstly, based on the structural characteristics of the Saturnin algorithm, sufficient conditions for the 3.5-round impossible differential distinguisher of the Saturnin algorithm were proposed and proven. Using these sufficient conditions, 64 distinguishers can be quickly constructed and divided into four categories. Secondly, these four categories of distinguishers can be extended forward by two rounds to obtain four attack paths. These four attack paths not only have the same plaintext structure but also have a large number of common key bits. By utilizing these two characteristics, the complexity of the attack scheme can be improved. Combining early plaintext death analysis techniques, a 5.5-round impossible differential attack scheme for the Saturnin algorithm was proposed. The data, storage, and time complexity are 2176.88 chosen plaintexts, 2143.88 algorithm scale, and 2176.91 times 5.5-round encryption respectively. This is currently a visible impossible differential attack scheme against the Saturnin algorithm.\",\"PeriodicalId\":276778,\"journal\":{\"name\":\"2023 4th International Seminar on Artificial Intelligence, Networking and Information Technology (AINIT)\",\"volume\":\"28 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-06-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2023 4th International Seminar on Artificial Intelligence, Networking and Information Technology (AINIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/AINIT59027.2023.10212614\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 4th International Seminar on Artificial Intelligence, Networking and Information Technology (AINIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AINIT59027.2023.10212614","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

新型电力系统需要高效、安全的通信技术,以促进各种设备和系统之间的信息交换。其中,加密技术是保证通信安全的关键。轻量级分组密码算法Saturnin与AES算法类似,即使在资源有限的环境中也能保持良好的安全性。因此,它可以应用于电力系统中的各种设备,如智能电表、传感器、控制器等。对Saturnin算法进行不可能差分分析,识别潜在的安全漏洞,提高电力系统的安全性。首先,根据Saturnin算法的结构特点,提出并证明了Saturnin算法3.5轮不可能差分区分的充分条件;利用这些充分条件,可以快速构建64个区分符,并将其分为四类。其次,这四类区分者可以向前延伸两轮,得到四条攻击路径。这四种攻击路径不仅具有相同的明文结构,而且具有大量的公共密钥位。利用这两个特征,可以提高攻击方案的复杂度。结合早期明文死亡分析技术,提出了一种针对Saturnin算法的5.5轮不可能差分攻击方案。数据复杂度为2176.88个选择明文,存储复杂度为2143.88个算法规模,时间复杂度为2176.91次5.5轮加密。这是目前可见的针对Saturnin算法的不可能差分攻击方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Improving Power System Information Security: Analysis of the Saturnin Cipher Algorithm
New power systems require efficient and secure communication technologies to facilitate information exchange between various devices and systems. Among these, encryption technology is key to ensuring communication security. The lightweight block cipher algorithm, Saturnin, is similar to the AES algorithm and maintains good security even in resource-limited environments. Therefore, it can be applied to various devices in the power system, such as smart meters, sensors, controllers, etc. An impossible differential analysis was conducted on the Saturnin algorithm to identify potential security vulnerabilities, thereby enhancing the security of the power system. Firstly, based on the structural characteristics of the Saturnin algorithm, sufficient conditions for the 3.5-round impossible differential distinguisher of the Saturnin algorithm were proposed and proven. Using these sufficient conditions, 64 distinguishers can be quickly constructed and divided into four categories. Secondly, these four categories of distinguishers can be extended forward by two rounds to obtain four attack paths. These four attack paths not only have the same plaintext structure but also have a large number of common key bits. By utilizing these two characteristics, the complexity of the attack scheme can be improved. Combining early plaintext death analysis techniques, a 5.5-round impossible differential attack scheme for the Saturnin algorithm was proposed. The data, storage, and time complexity are 2176.88 chosen plaintexts, 2143.88 algorithm scale, and 2176.91 times 5.5-round encryption respectively. This is currently a visible impossible differential attack scheme against the Saturnin algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信