APLIKASI KEAMANAN SMS MENGGUNAKAN ALGORITMA RIJNDAEL

Authors

  • Raisul Azhar STMIK Bumigora Mataram
  • Kurniawan Kurniawan STMIK Bumigora Mataram

DOI:

https://doi.org/10.30812/matrik.v16i1.15

Keywords:

SMS, Cryptography Rijndael, Smartphon, Block Chipper

Abstract

Mobile phones and smartphones providing the basic features of SMS (Short Message Service). Messages sent through SMS facility sometimes confidential, so that the necessary mechanisms to protect messages from crime. Mechanism that can be used to protect the message is to use a cryptographic algorithm Rijndael. This algorithm is a cryptographic algorithm chipher 128-bit block that has the ability to protect confidential messages. This research resulted in an application that can be used to protect the SMS message when the message is sent and received by users. Based on research conducted on the length of different messages with the same key length is obtained that the length of the message used computing time takes longer than the length of the message is the same and different key lengths.

Downloads

Download data is not yet available.

References

[1] Rosidi, Romzi Imron. (2004). “Membuat Sendiri SMS Gateway Berbasis Protokol SMPP”. Andi Yogyakarta
[2] Defni, Rahmayun Indri. (2014). “Enkripsi SMS (Short Message Service) Pada Telepon Seluler Berbasis Android Dengan Metode RC6”. Jurnal Momentum Vol. 16 No. 1 ISSN : 1693-752X.
[3] Surian, Didi. (2006). “Algoritma Kriptografi AES Rijndael”. Jurnal Teknik Elektro TESLA Vol. 8 No. 2, 97 – 101.
[4] Ariyus, Dony. (2008). “Pengantar Ilmu Kriptografi”. Yogyakarta : Andi.
[5] Irawan, Arif Fajar. (2013). “Sistem Keamanan Pesan pada Android Gingerbread (2.3.4) dengan Algoritma LUC”. Universitas Jember.

Downloads

Published

2016-11-29

How to Cite

Azhar, R., & Kurniawan, K. (2016). APLIKASI KEAMANAN SMS MENGGUNAKAN ALGORITMA RIJNDAEL. MATRIK : Jurnal Manajemen, Teknik Informatika Dan Rekayasa Komputer, 16(1), 105–112. https://doi.org/10.30812/matrik.v16i1.15

Issue

Section

Articles

Similar Articles

1 2 > >> 

You may also start an advanced similarity search for this article.