A generic model for security algorithms in mobile electronic payment systems

Quan Yuan, Wei-Chao Chang, Shenglin Xu
{"title":"A generic model for security algorithms in mobile electronic payment systems","authors":"Quan Yuan, Wei-Chao Chang, Shenglin Xu","doi":"10.3233/jcm-226694","DOIUrl":null,"url":null,"abstract":"At a time when communication network technology is developing rapidly, the security of the Internet has aroused widespread concern in the academic community. In particular, electronic payment, which has been booming in recent years, has great security risks and people are prone to information leakage and property loss in the process of payment. In order to solve these problems, this study adopts the AES to encrypt the information in the payment process, introduces the RSA Public Key System (RSA) and the SM4 packet cipher algorithm for comparison, and analyses their encryption (decryption) speed, decryption (decryption) speed and encryption speed respectively. (decryption) speed, as well as PR curve, Loss function and sensitivity. The results show that the AES algorithm has a faster encryption (decryption) speed compared to the other two algorithms. In the PR curve, the AES algorithm has an AP value of 0.9988, which is significantly higher than the other two algorithms, and has a better balance between accuracy and recall, and better performance. In the sensitivity analysis, the AES algorithm can have the highest sensitivity of 97.88%. This is significantly higher than the 93.47% and 96.59% of the other two algorithms. Moreover, as shown by the Loss function of the AES algorithm, it converges faster and the Liss value varies between 0.1 and 0.9. In summary, the AES algorithm has a faster encryption speed and is better in terms of accuracy, convergence speed and security factor in all aspects. This also demonstrates the feasibility and effectiveness of this algorithm for information security protection in electronic payment processes.","PeriodicalId":14668,"journal":{"name":"J. Comput. Methods Sci. Eng.","volume":"23 1","pages":"1425-1438"},"PeriodicalIF":0.0000,"publicationDate":"2023-01-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"J. Comput. Methods Sci. Eng.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3233/jcm-226694","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

At a time when communication network technology is developing rapidly, the security of the Internet has aroused widespread concern in the academic community. In particular, electronic payment, which has been booming in recent years, has great security risks and people are prone to information leakage and property loss in the process of payment. In order to solve these problems, this study adopts the AES to encrypt the information in the payment process, introduces the RSA Public Key System (RSA) and the SM4 packet cipher algorithm for comparison, and analyses their encryption (decryption) speed, decryption (decryption) speed and encryption speed respectively. (decryption) speed, as well as PR curve, Loss function and sensitivity. The results show that the AES algorithm has a faster encryption (decryption) speed compared to the other two algorithms. In the PR curve, the AES algorithm has an AP value of 0.9988, which is significantly higher than the other two algorithms, and has a better balance between accuracy and recall, and better performance. In the sensitivity analysis, the AES algorithm can have the highest sensitivity of 97.88%. This is significantly higher than the 93.47% and 96.59% of the other two algorithms. Moreover, as shown by the Loss function of the AES algorithm, it converges faster and the Liss value varies between 0.1 and 0.9. In summary, the AES algorithm has a faster encryption speed and is better in terms of accuracy, convergence speed and security factor in all aspects. This also demonstrates the feasibility and effectiveness of this algorithm for information security protection in electronic payment processes.
移动电子支付系统中安全算法的通用模型
在通信网络技术飞速发展的今天,互联网的安全问题引起了学术界的广泛关注。特别是近年来蓬勃发展的电子支付,存在着很大的安全隐患,人们在支付过程中容易发生信息泄露和财产损失。为了解决这些问题,本研究采用AES对支付过程中的信息进行加密,并引入RSA公钥系统(RSA)和SM4包密码算法进行比较,分别分析了它们的加(解密)速度、解密(解密)速度和加密速度。(解密)速度,以及PR曲线,Loss函数和灵敏度。结果表明,与其他两种算法相比,AES算法具有更快的加(解密)速度。在PR曲线中,AES算法的AP值为0.9988,显著高于其他两种算法,并且在准确率和召回率之间有更好的平衡,性能也更好。在灵敏度分析中,AES算法的灵敏度最高,达到97.88%。这明显高于其他两种算法的93.47%和96.59%。从AES算法的Loss函数可以看出,AES算法收敛速度更快,Liss值在0.1 ~ 0.9之间变化。综上所述,AES算法加密速度更快,在准确率、收敛速度、安全系数等各方面都有较好的表现。这也证明了该算法在电子支付过程中信息安全保护的可行性和有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信