A Lightweight Message Authentication Code for Virtual Work in Future Smart Cities

Z. Pindar, J. O. Fayomi, Nazir H. Waziri, B. Abdulhamid, Sapiee Jamel
{"title":"A Lightweight Message Authentication Code for Virtual Work in Future Smart Cities","authors":"Z. Pindar, J. O. Fayomi, Nazir H. Waziri, B. Abdulhamid, Sapiee Jamel","doi":"10.1109/E-TEMS46250.2020.9111859","DOIUrl":null,"url":null,"abstract":"Data security remains a severe challenge of every IoT setting. As smart devices exchange data and information over the internet, there is a growing concern over securing the integrity and confidentiality of this exchange. Recently the NIST called for submission of proposals for lightweight cryptographic algorithms, to be deployed in IoT devices and other CPU and memory-constrained environment. While many of the submissions are based on existing block cyphers or hash functions, this paper presents a proof-of-concept lightweight MAC uses a Permutation-Quasigroup string transformation as a building block. The string transformation function is initially proposed as a building block for an error detection system in our earlier work. The MAC is implemented and run on a Raspberry Pi B+ single-board computer (SBC), and the result shows that for 3.73%, 3.55% and 2.82% of CPU resources are utilized for hashing messages of size 32 bits, 64 bits and 128 bits respectively. Similarly, the execution time of 0.7secs, 1.02secs and 2.34secs are achieved for hashing messages of size 32 bits, 64 bits and 128 bits respectively. Randomness test was conducted using the NIST statistical test suite, and the result shows that output is sufficiently random. Finally, the MAC is resistant to key exhaustive search attack and is easy to implement.","PeriodicalId":345917,"journal":{"name":"2020 IEEE European Technology and Engineering Management Summit (E-TEMS)","volume":"5104 3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE European Technology and Engineering Management Summit (E-TEMS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/E-TEMS46250.2020.9111859","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Data security remains a severe challenge of every IoT setting. As smart devices exchange data and information over the internet, there is a growing concern over securing the integrity and confidentiality of this exchange. Recently the NIST called for submission of proposals for lightweight cryptographic algorithms, to be deployed in IoT devices and other CPU and memory-constrained environment. While many of the submissions are based on existing block cyphers or hash functions, this paper presents a proof-of-concept lightweight MAC uses a Permutation-Quasigroup string transformation as a building block. The string transformation function is initially proposed as a building block for an error detection system in our earlier work. The MAC is implemented and run on a Raspberry Pi B+ single-board computer (SBC), and the result shows that for 3.73%, 3.55% and 2.82% of CPU resources are utilized for hashing messages of size 32 bits, 64 bits and 128 bits respectively. Similarly, the execution time of 0.7secs, 1.02secs and 2.34secs are achieved for hashing messages of size 32 bits, 64 bits and 128 bits respectively. Randomness test was conducted using the NIST statistical test suite, and the result shows that output is sufficiently random. Finally, the MAC is resistant to key exhaustive search attack and is easy to implement.
面向未来智慧城市虚拟工作的轻量级消息认证码
数据安全仍然是每个物联网设置的严峻挑战。随着智能设备在互联网上交换数据和信息,人们越来越关注确保这种交换的完整性和保密性。最近,NIST呼吁提交轻量级加密算法的提案,以部署在物联网设备和其他CPU和内存受限的环境中。虽然许多提交都是基于现有的块密码或哈希函数,但本文提出了一个概念验证的轻量级MAC,它使用置换-拟群字符串转换作为构建块。在我们早期的工作中,字符串转换函数最初是作为错误检测系统的构建块提出的。MAC在Raspberry Pi B+单板计算机(SBC)上实现和运行,结果表明,分别有3.73%,3.55%和2.82%的CPU资源用于大小为32位,64位和128位的哈希消息。同样,对于大小为32位、64位和128位的哈希消息,执行时间分别为0.7秒、1.02秒和2.34秒。使用NIST统计测试套件进行随机性测试,结果表明输出具有足够的随机性。最后,该MAC能够抵抗密钥穷举搜索攻击,易于实现。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信