TEA, a Tiny Encryption Algorithm

We give a short routine which is based on a Feistel iteration and uses a large number of rounds to get security with simplicity.

• Type: Conference
• Year: 1994
• Where: FSE
• Authors: David J. Wheeler, Roger M. Needham
• Keywords: Cryptology, Feistel Iteration, FSE 1994, Large Number