iSIMP with Integrity Validation using MD5 Hash

Shiv Kumar Verma, Naved Anjum, Aryansh Sharma, Anubhav Mishra
{"title":"iSIMP with Integrity Validation using MD5 Hash","authors":"Shiv Kumar Verma, Naved Anjum, Aryansh Sharma, Anubhav Mishra","doi":"10.1109/ComPE53109.2021.9752433","DOIUrl":null,"url":null,"abstract":"Communication through Internet is common now a days. Type of communication, where one need to transfer any file became vulnerable due to penetration of unknown person in network to steal the important information, it was always challenging for researchers to send or received exact information on the network and also maintain the speed of transferring file. Preventing attackers from manipulating data and integrity validity is main objectives of this research paper. In first experiments SHA-256 were used to implements for quick and secure transfer of information, later in experiments it was found that MD5 Cryptographic hash function is more secure and faster. The main objective of this paper is to measure the performance of both algorithm and fusion of algorithm give better result and accuracy level also satisfactory as compare to other algorithms. Performance of the algorithms measured on the running time and complexity of MD5 and SHA-256. The complexity of the Algorithms MD5 and SHA-256 is that the same, i.e., θ(N), however the speed is of MD5 is better than SHA-256.","PeriodicalId":211704,"journal":{"name":"2021 International Conference on Computational Performance Evaluation (ComPE)","volume":"60 5","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 International Conference on Computational Performance Evaluation (ComPE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ComPE53109.2021.9752433","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Communication through Internet is common now a days. Type of communication, where one need to transfer any file became vulnerable due to penetration of unknown person in network to steal the important information, it was always challenging for researchers to send or received exact information on the network and also maintain the speed of transferring file. Preventing attackers from manipulating data and integrity validity is main objectives of this research paper. In first experiments SHA-256 were used to implements for quick and secure transfer of information, later in experiments it was found that MD5 Cryptographic hash function is more secure and faster. The main objective of this paper is to measure the performance of both algorithm and fusion of algorithm give better result and accuracy level also satisfactory as compare to other algorithms. Performance of the algorithms measured on the running time and complexity of MD5 and SHA-256. The complexity of the Algorithms MD5 and SHA-256 is that the same, i.e., θ(N), however the speed is of MD5 is better than SHA-256.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
使用MD5哈希进行完整性验证的iSIMP
如今,通过互联网进行交流是很常见的。在这种通信类型中,需要传输的任何文件都会因网络中未知人员的渗透而变得脆弱,从而窃取重要信息,因此在网络上发送或接收准确的信息并保持传输文件的速度一直是研究人员面临的挑战。防止攻击者操纵数据和完整性有效性是本文研究的主要目标。在最初的实验中使用SHA-256来实现快速安全的信息传输,后来的实验发现MD5加密哈希函数更安全,更快。本文的主要目的是衡量算法和算法融合的性能,与其他算法相比,得到更好的结果和令人满意的精度水平。通过MD5和SHA-256的运行时间和复杂度来衡量算法的性能。MD5算法和SHA-256算法的复杂度相同,即θ(N),但MD5算法的速度优于SHA-256算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
iSIMP with Integrity Validation using MD5 Hash A Fault Detection Scheme for IoT-enabled WSNs YOLOv3 based Real Time Social Distance Violation Detection in Public Places Finite Element Analysis of Femur Bone under Different Loading Conditions An Efficient and Anonymous Authentication Key Agreement Protocol for Smart Transportation System
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1