使用哈夫曼算法压缩短信的 RSA 和 AES 性能比较

Laurentinus Laurentinus, H. Pradana, Dwi Yuny Sylfania, F. P. Juniawan
{"title":"使用哈夫曼算法压缩短信的 RSA 和 AES 性能比较","authors":"Laurentinus Laurentinus, H. Pradana, Dwi Yuny Sylfania, F. P. Juniawan","doi":"10.14710/jtsiskom.2020.13468","DOIUrl":null,"url":null,"abstract":"Improved security of short message services (SMS) can be obtained using cryptographic methods, both symmetric and asymmetric, but must remain efficient. This paper aims to study the performance and efficiency of the symmetric crypto of AES-128 and asymmetric crypto of RSA with message compression in securing SMS messages. The ciphertext of RSA and AES were compressed using the Huffman algorithm. The average AES encryption time for each character is faster than RSA, which is 5.8 and 24.7 ms/character for AES and AES+Huffman encryption and 8.7 and 45.8 ms/character for RSA and RSA+Huffman, from messages with 15, 30, 60 and 90 characters. AES decryption time is also faster, which is 27.2 ms/character compared to 47.6 ms/character in RSA. Huffman compression produces an average efficiency of 24.8 % for the RSA algorithm, better than 17.35 % of AES efficiency for plaintext of 1, 16, 45, and 88 characters.","PeriodicalId":56231,"journal":{"name":"Jurnal Teknologi dan Sistem Komputer","volume":"2 8","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2020-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Performance comparison of RSA and AES to SMS messages compression using Huffman algorithm\",\"authors\":\"Laurentinus Laurentinus, H. Pradana, Dwi Yuny Sylfania, F. P. Juniawan\",\"doi\":\"10.14710/jtsiskom.2020.13468\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Improved security of short message services (SMS) can be obtained using cryptographic methods, both symmetric and asymmetric, but must remain efficient. This paper aims to study the performance and efficiency of the symmetric crypto of AES-128 and asymmetric crypto of RSA with message compression in securing SMS messages. The ciphertext of RSA and AES were compressed using the Huffman algorithm. The average AES encryption time for each character is faster than RSA, which is 5.8 and 24.7 ms/character for AES and AES+Huffman encryption and 8.7 and 45.8 ms/character for RSA and RSA+Huffman, from messages with 15, 30, 60 and 90 characters. AES decryption time is also faster, which is 27.2 ms/character compared to 47.6 ms/character in RSA. Huffman compression produces an average efficiency of 24.8 % for the RSA algorithm, better than 17.35 % of AES efficiency for plaintext of 1, 16, 45, and 88 characters.\",\"PeriodicalId\":56231,\"journal\":{\"name\":\"Jurnal Teknologi dan Sistem Komputer\",\"volume\":\"2 8\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-04-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Jurnal Teknologi dan Sistem Komputer\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.14710/jtsiskom.2020.13468\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Jurnal Teknologi dan Sistem Komputer","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.14710/jtsiskom.2020.13468","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

使用对称和非对称加密方法可以提高短信服务(SMS)的安全性,但必须保持高效。本文旨在研究 AES-128 对称加密法和 RSA 非对称加密法的性能和效率,以及在确保短信安全方面的信息压缩。使用哈夫曼算法对 RSA 和 AES 的密文进行了压缩。从 15、30、60 和 90 个字符的信息来看,AES 加密每个字符的平均时间比 RSA 快,AES 和 AES+Huffman 加密为 5.8 和 24.7 毫秒/字符,RSA 和 RSA+Huffman 为 8.7 和 45.8 毫秒/字符。AES 的解密时间也更快,为 27.2 毫秒/字符,而 RSA 为 47.6 毫秒/字符。对于 1、16、45 和 88 个字符的明文,哈夫曼压缩产生的 RSA 算法平均效率为 24.8%,优于 AES 的 17.35%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Performance comparison of RSA and AES to SMS messages compression using Huffman algorithm
Improved security of short message services (SMS) can be obtained using cryptographic methods, both symmetric and asymmetric, but must remain efficient. This paper aims to study the performance and efficiency of the symmetric crypto of AES-128 and asymmetric crypto of RSA with message compression in securing SMS messages. The ciphertext of RSA and AES were compressed using the Huffman algorithm. The average AES encryption time for each character is faster than RSA, which is 5.8 and 24.7 ms/character for AES and AES+Huffman encryption and 8.7 and 45.8 ms/character for RSA and RSA+Huffman, from messages with 15, 30, 60 and 90 characters. AES decryption time is also faster, which is 27.2 ms/character compared to 47.6 ms/character in RSA. Huffman compression produces an average efficiency of 24.8 % for the RSA algorithm, better than 17.35 % of AES efficiency for plaintext of 1, 16, 45, and 88 characters.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
6
审稿时长
6 weeks
期刊最新文献
TATOPSIS: A decision support system for selecting a major in university with a two-way approach and TOPSIS Regional clustering based on economic potential with a modified fuzzy k-prototypes algorithm for village developing target determination River water level measurement system using Sobel edge detection method Classification of beneficiaries for the rehabilitation of uninhabitable houses using the K-Nearest Neighbor algorithm Sequence-based prediction of protein-protein interaction using autocorrelation features and machine learning
×
引用
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