HARDWARE IMPLEMENTATION OF TEA TINY ENCRYPTION ALGORITHM. ANOOP KUMAR PALVAI. The Tiny Encryption Algorithm (TEA) is one of the fastest and most efficient cryptographic algorithms in existence. Developed by Roger Needham and David Wheeler. OVERVIEW OF TEA. TEA is a symmetric key algorithm.
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
HARDWARE IMPLEMENTATION OF TEA
TINY ENCRYPTION ALGORITHM
ANOOP KUMAR PALVAI
The Tiny Encryption Algorithm (TEA) is one of the fastest and most efficient cryptographic algorithms in existence.
Developed by Roger Needham and David Wheeler.
OVERVIEW OF TEA
TEA is a symmetric key algorithm.
TEA is designed to minimize memory footprint and maximize speed.
It is a Feistel type cipher that uses operations from mixed (orthogonal)
Achieves the Shannon's properties of complete diffusion and confusion with out the employment of S & P boxes, after only six rounds but thirty two rounds are recommended.
TEA seems to be highly resistant to differential cryptanalysis.
TEA is a compromise for safety, ease of implementation, lack of specialized tables, and reasonable performance.
FUNCTIONALITY OF TEA
Inputs to encryption algorithm are 64 bits of plain/cipher text , 128 bits of key and output is a cipher/plain text.
It performs operations on 32 bit words.
Each half of message is used to encrypt the other half over 64 rounds of processing and then combine to produce the cipher text block.
OPERATIONS PERFORMED IN A SINGLE ITERATION
Each round i has inputs Left[i-1] and Right[i-1], derived from the previous round, as well as a sub key K[i] derived from the 128 bit overall K.
The sub keys K[i] are different from K and from each other.
The constant delta =(9E3779B9)h, is derived from the golden number ratio to ensure sub keys to be different.
Decryption is essentially the same as the encryption process.
The sub keys K[i] are used in the reverse order.
It reduces the area required for implementation by half.
IMPLENTATION IN HARDWARE
St0 reset = ’1’
s1=1, en1 =1, en2 =1,en4 =1
a = ‘0’
Sel = 01 01
en2=1, en4=1, s1=1, s2=1
en1=1, en4 =1, s1 = 1, s2=0
en3 = 1, sel = 10
en3 = 1, sel = 10
en1=1, s1=1, s2=0
en2=1, s1=1, s2=1
Sum = x00000000