Improving the security guarantees, authenticity and confidentiality in short message service of mobile applications

Mantoro, Teddy; Laurentinus, Laurentinus; Agani, Nazori; Ayu, Media Anugerah

doi:10.1109/citsm.2016.7577592

Cited by 3 publications

(1 citation statement)

References 3 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Layanan pesan ini telah digunakan di setiap bidang, di antaranya perbankan untuk transaksi m-banking, bidang e-commerce, dan personal. Suatu pesan SMS dikirim melalui telepon seluler melewati Base Transceiver Station (BTS) dan diarahkan ke Short Message Service (SMSC) [1]. Komunikasi melalui SMS memungkinkan data dicuri dan tidak aman.…”

Section: Pendahuluanunclassified

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

Laurentinus¹,

Pradana²,

Sylfania³

et al. 2020

Jurnal Teknologi dan Sistem Komputer

View full text Add to dashboard Cite

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.

show abstract

Section: Pendahuluanunclassified