Apply Block Ciphers Using Tiny Encryption Algorithm (TEA)
Main Article Content
Abstract
Ciphers can be either symmetric-key or public-key. Symmetric-key ciphers are the most famous and important elements in many cryptographic systems. Individually, they provide confidentiality and privacy. The Aim of this paper is to Apply symmetric block ciphers algorithm which is called Tiny Encryption algorithm (TEA). There are many types of block cipher use different techniques and functions using basic arithmetic operations such as XOR, addition, subtraction, multiplication, bitwise shift, and division. TEA cipher uses XOR, addition and bitwise shift. The paper presents how a block cipher could be constructed in general, it includes an observation of the history, inventors, and algorithms of the TEA block ciphers. It also discuss the manner did the programming took in terms of modularity, simplicity, resource reservation, in the previous algorithm the user cannot enter the plain text as a characters, it must enter the ASCII cod of the characters we write a lot e of functions to solve this problem also we enable the user to save his message in text file to make him use it to receive a message from email ,Also the time of encryption and decryption are calculated to measure the performance of the algorithm., The implementation of TEA is made using C/C++ Borland compiler version( 4.5).
Article Details
This work is licensed under a Creative Commons Attribution 4.0 International License.
How to Cite
References
Alfred J. Menezes, Paul C. van Orschot and Scott A.Vanstone 1997. Handbook of Applied Cryptography.CRC Press Iisbn 0-8493-85237, pp 816 .
Andem, Vikram Reddy ,2003. A Cryptanalysis of the Tiny Encryption Algorithm, Masters thesis. Tuscaloosa: The University of Alabama.
Wheeler, D.J., & Needham, R.J. 1994. TEA, a tiny encryption algorithm. In Fast Software Encryption – Proceedings of the 2nd International Workshop,1008.
FIPS Nov. 2001. specification for the Advanced Encryption Standard. National Institute of Standards and Technology, 197: 14-20
John Kelsey, Bruce Schneier, and David Wagner. 1997. Related -Key cryptanalysis of 3-WAY,Biham-DES,CAST,DES-X NEW DES,RC2 and TEA.Lecture Notes in Computer Science,1334: 233–246.
Bart Van Rompay. June,2004. Analysis and design of cryptographic hash functions, Mac algorithms and block ciphers,PHD thesis, katholicke University Leuven ,B.preneel and J.vandewalle (promoters), 240:10-14.
V. Rijmen. Oct. 1997. Cryptanalysis and Design of Iterated Block Ciphers. Doctoral Dissertation, Katholic University of Leaven.
Shannon C. E. Oct, 1994. Communication theory of secrecy systems. Bell System Technical Journal, 28: 656-715.
Vikram Reddy Andem. 2003. A Cryptanalysis of the Tiny Encryption Algorithm, Masters Thesis, the University of Alabama, Tuscaloosa.
FIPS. Oct, 1999. Data Encryption Standard. National Institute of Standards and Technology. (Specifies the use of Triple-DES), 46-3.