Rohmat Nur Ibrahim


Data security is one of the most important aspects in information technology. With a high level of security, it is expected that the information presented can be maintained its authenticity. The method for forming systems uses object-oriented methods. By using the Tiny Encryption Algorithm (TEA) Algorithm which is a symmetric key cryptographic algorithm, this problem can be overcome. The strength of this algorithm lies in feistel networks (including substitution operations, permutations and arithmetic modular), the implementation of which is analyzed using the encryption and encryption message encryption process in text format (as in * .txt format). Data security software is expected to be achieved so that other researchers who will research further can develop it again.

Keywords: Data Security, Algorithms, Symmetry, TEA


Ariyus, Dony. (2008). ”Pengantar Ilmu Kriptografi”, Penerbit Andi, Jakarta Greg Perry & Ian Spencer, 1995, Visual C++, Andi, Yogyakarta

D. Wheeler and R. Neddham. 1994. TEA a Tiny Encryption Algorithm. Diaksespada tanggal 15 Juki 2010. Tersedia di :¬¬¬¬¬¬¬¬¬¬¬¬¬Encryption_Algorithm

Halvorson, Michael,. (2000). Step by step Microsoft Visual Basic 6.0, Elex Media Komputindo, Jakarta.

Kurniawan, Yusuf, “Kroptografi keamanan internet dan jaringan komnunikasi”,

Informatika, 2004.

Munir, Rinaldi. (2006). Diktat Kuliah IF5054 Kriptografi. Program Studi Teknik

Informatika - Institut Teknologi Bandung.

Petroutsos, Evangelos, (1998). Mastering Visual Basic Basic 6 , Sybex, California

Pressman. Roger ( 2005). Software Enginering, McGrawHill , Singapore

Rinaldi Munir, (2006). Kriprografi, Informatika, Bandung.

Stallings Wiliam, Cryptography and Network Security, Prentice Hall, 2000

Uzzin, Isbat. 2008. Diktat Kuliah Security Jaringan Introduction Kriptografi. Jurusan Teknik Informatika – Politeknik Elektronika Negeri Surabaya- ITS.

Vikram Reddy Andem. 2003. A Crytanalysis Of The Tiny Encryption. DiaksesTanggal 20 Juni 2010. Tersedia di


  • There are currently no refbacks.

Copyright (c) 2019

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.