An Efficient Message Authentication Code Based on Modified MD5-384 Bits Hash Function and Quasigroup

Umesh Kumar, V. Venkaiah
{"title":"An Efficient Message Authentication Code Based on Modified MD5-384 Bits Hash Function and Quasigroup","authors":"Umesh Kumar, V. Venkaiah","doi":"10.4018/ijcac.308275","DOIUrl":null,"url":null,"abstract":"Cryptographic hash functions and HMACs are used to achieve various security goals such as message integrity, message authentication, digital signatures, and entity authentication. This article proposes (1) a new hash function (QGMD5-384) and (2) an efficient message authentication code (QGMAC-384) based on a quasigroup. A quasigroup is a non-associative algebraic structure and its number grows exponentially with its order. Note that the existing hash functions and HMACs that use quasigroups are vulnerable to prefix and suffix attacks. The security of the proposed hash function is analyzed by comparing it with the MD5 and SHA-384. It is found that the proposed QGMD5-384 is more secure. Also, QGMAC-384 is analyzed against brute force and forgery attacks and it is found to be resistant to these attacks. The performance of the new schemes is compared with their counterparts, such as SHA-384 and HMAC-SHA-384. It is observed that QGMD5-384 and QGMAC-384 are slightly slower than MD5 and HMAC-MD5, respectively, but faster than both the SHA-384 and the HMAC-SHA-384.","PeriodicalId":442336,"journal":{"name":"Int. J. Cloud Appl. Comput.","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Cloud Appl. Comput.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4018/ijcac.308275","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Cryptographic hash functions and HMACs are used to achieve various security goals such as message integrity, message authentication, digital signatures, and entity authentication. This article proposes (1) a new hash function (QGMD5-384) and (2) an efficient message authentication code (QGMAC-384) based on a quasigroup. A quasigroup is a non-associative algebraic structure and its number grows exponentially with its order. Note that the existing hash functions and HMACs that use quasigroups are vulnerable to prefix and suffix attacks. The security of the proposed hash function is analyzed by comparing it with the MD5 and SHA-384. It is found that the proposed QGMD5-384 is more secure. Also, QGMAC-384 is analyzed against brute force and forgery attacks and it is found to be resistant to these attacks. The performance of the new schemes is compared with their counterparts, such as SHA-384 and HMAC-SHA-384. It is observed that QGMD5-384 and QGMAC-384 are slightly slower than MD5 and HMAC-MD5, respectively, but faster than both the SHA-384 and the HMAC-SHA-384.
一种基于改进MD5-384位哈希函数和拟群的高效消息认证码
加密哈希函数和hmac用于实现消息完整性、消息认证、数字签名和实体认证等各种安全目标。本文提出了(1)一个新的哈希函数(QGMD5-384)和(2)一个基于准群的高效消息认证码(QGMAC-384)。拟群是一种非结合代数结构,其数量随其阶数呈指数增长。请注意,现有的散列函数和使用准组的hmac很容易受到前缀和后缀攻击。通过与MD5和SHA-384的比较,分析了所提出的哈希函数的安全性。结果表明,提出的QGMD5-384具有更高的安全性。此外,QGMAC-384对暴力破解和伪造攻击进行了分析,发现它具有抵抗这些攻击的能力。并与现有的SHA-384和HMAC-SHA-384算法进行了性能比较。可以看出,QGMD5-384和QGMAC-384分别比MD5和HMAC-MD5略慢,但比SHA-384和HMAC-SHA-384都快。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信