Perbandingan kinerja RSA dan AES terhadap kompresi pesan SMS menggunakan algoritme Huffman

Performance comparison of RSA and AES to SMS messages compression using Huffman algorithm

*Laurentinus Laurentinus orcid scopus  -  STMIK Atma Luhur, Indonesia
Harrizki Arie Pradana  -  STMIK Atma Luhur, Indonesia
Dwi Yuny Sylfania  -  STMIK Atma Luhur, Indonesia
Fransiskus Panca Juniawan  -  STMIK Atma Luhur, Indonesia
Received: 20 Aug 2019; Revised: 12 Apr 2020; Accepted: 19 Apr 2020; Published: 31 Jul 2020; Available online: 24 Apr 2020.
Open Access Copyright (c) 2020 Jurnal Teknologi dan Sistem Komputer
Creative Commons License This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

Citation Format:
Article Info
Section: Original Research Articles
Language: ID
Statistics: 354 117
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.
Keywords: criptography; Huffman compression; RSA; AES; SMS encryption

Article Metrics:

  1. T. Mantoro, L. Laurentinus, N. Agani, and M. A. Ayu, “Improving the security guarantees, authenticity and confidentiality in short message service of mobile applications,” in 4th International Conference on Cyber and IT Service Management, Bandung, Indnesia, Apr. 2016, pp. 1-6. doi: 10.1109/CITSM.2016.7577592
  2. A. Barenghi, G. M. Bertoni, L. Breveglieri, and G. Pelosi, “A fault induction technique based on voltage underfeeding with application to attacks against AES and RSA,” Journal of Systems and Software, vol. 86, no. 7, pp. 1864-1878, 2013. doi: 10.1016/j.jss.2013.02.021
  3. A. Al-Hasib and A. A. M. M. Haque, “A comparative study of the performance and security issues of AES and RSA cryptography,” in Third International Conference on Convergence and Hybrid Information Technology, Busan, South Korea, Nov. 2008, pp. 505-510. doi: 10.1109/ICCIT.2008.179
  4. N. Anwar, M. Munawwar, M. Abduh, and N. B. Santosa, “Komparatif performance model keamanan menggunakan metode algoritma AES 256 bit dan RSA,” Jurnal RESTI (Rekayasa Sistem dan Teknologi Informasi), vol. 2, no. 3, pp. 783-791, 2018. doi: 10.29207/resti.v2i3.606
  5. V. S. Mahalle and A. K. Shahade, “Enhancing the data security in cloud by implementing hybrid (RSA & AES) encryption algorithm,” in 2014 International Conference on Power, Automation and Communication, Amravati, India, Oct. 2014, pp. 146-149. doi: 10.1109/INPAC.2014.6981152
  6. G. Singh and S. Supriya, “A study of encryption algorithms (RSA, DES, 3DES and AES) for information security,” International Journal of Computer Applications, vol. 67, no. 19, pp. 33-38, 2013. doi: 10.5120/11507-7224
  7. P. Mahajan and A. Sachdeva, “A study of encrytion algorithms AES, DES and RSA for security,” Global Journal of Computer Science and Technology Network, Web & Security, vol. 13, no. 15, pp. 14-20, 2013.
  8. P. Patil, P. Narayankar, D. G. Narayan, and S. M. Meena, “A comprehensive evaluation of cryptographic algorithms: DES, 3DES, AES, RSA and Blowfish,” in Procedia Computer Science, vol. 78, pp. 617-624, 2016. doi: 10.1016/j.procs.2016.02.108
  9. A. Thomas and E. M. Manuel, “Embedment of montgomery algorithm on elliptic curve cryptography over rsa public key cryptography,” Procedia Technology, vol. 24, pp. 911-917, 2016. doi: 10.1016/j.protcy.2016.05.179
  10. N. Silva, D. Pigatto, P. Martins, and K. Branco, “Case studies of performance evaluation of asymmetric and symmetric cryptographic algorithms for embedded systems and a general purpose computer,” Journal of Network and Computer Applicaitons, vol. 60, no. C, pp. 130-143. 2015. doi: 10.1016/j.jnca.2015.10.007
  11. N. Khanezaei and Z. M. Hanapi, “A framework based on RSA and AES encryption algorithms for cloud computing services,” in IEEE Conference on System, Process and Control, Kuala Lumpur, Malaysia, Dec. 2014, pp. 56-62. doi: 10.1109/SPC.2014.7086230
  12. L. Gong, K. Qiu, C. Deng, and N. Zhou, “An optical image compression and encryption scheme based on compressive sensing and RSA algorithm,” Optics and Lasers in Engineering, vol. 121, pp. 169-180, 2019. doi: 10.1016/j.optlaseng.2019.03.006
  13. J. Thakur and N. Kumar, “DES, AES and Blowfish: symmetric key cryptography algorithms simulation based performance analysis,” International Journal of Emerging Technology and Advanced Engineering, vol. 1, no. 2, pp. 6-12, 2011.
  14. R. Bhanot and R. Hans, “A review and comparative analysis of various encryption algorithms,” International Journal of Security and Its Applications, vol. 9, no. 4, pp. 289-306, 2015. doi: 10.14257/ijsia.2015.9.4.2
  15. L. Laurentinus, “Implementasi kriptografi dan kompresi SMS menggunakan algoritma RC6 dan algoritma Huffman berbasis Android,” Jurnals of Indo Global Mandiri University, vol. 8, no. 1, pp. 36-42, 2017.
  16. A. P. U. Siahaan, “Implementasi teknik kompresi teks Huffman,” Jurnal Informatika, vol. 10, no. 2, pp. 1251-1261, 2016. doi: 10.26555/jifo.v10i2.a5070
  17. A. Pahdi, “Algoritme Huffman dalam pemampatan dan enkripsi data,” IJNS: Indonesian Journal of Network & Security, vol. 6, no. 3, pp. 1-7, 2017.

No citation recorded.