Guest
Thinking To Register
hi iam kanakamba i like to have the ppt of tiny encryption algorithm
Posts: 11,133
Joined: Feb 2012
In cryptography the Tiny Encryption Algorithm (TEA) is a block cipher notable for its simplicity of description and implementation, typically a few lines of code. It was designed by David Wheeler and Roger Needham of the Cambridge Computer Laboratory; was first presented at the Fast Software Encryption Workshop in Leuven in 1994 and was first published in the proceedings of that workshop. The figure is not subject to any patent.
TEA works with two unsigned 32-bit integers (could be derived from a 64-bit data block) and uses a 128-bit key. It has a Feistel structure with 64 suggested rounds, typically implemented in pairs called cycles. It has an extremely simple key program, which blends all key material in exactly the same way for each cycle. Different multiples of a magic constant are used to prevent simple attacks based on the symmetry of the rounds. The magic constant, 2654435769 or 0x9E3779B9 is chosen to be ⌊232 / φ⌋, where φ is the golden ratio.
TEA has some weaknesses. Most notably, it suffers from equivalent keys: each key is equivalent to another three, which means that the effective size of the key is only 126 bits. As a result, TEA is especially bad as a cryptographic hash function. This weakness led to a method to hack the Microsoft Xbox game console, where the figure was used as a hash function.