Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

FSE
1994
Springer

favoriteEmaildiscussreport

145views Cryptology» more FSE 1994»

TEA, a Tiny Encryption Algorithm

13 years 8 months ago

TEA, a Tiny Encryption Algorithm

Download www.cix.co.uk

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

David J. Wheeler, Roger M. Needham

Real-time Traffic

Cryptology | Feistel Iteration | FSE 1994 | Large Number |

claim paper

Related Content

» Implementing the TEA algorithm on sensors

» GPU random numbers via the tiny encryption algorithm

» Functional Correctness Proofs of Encryption Algorithms

» A verifying core for a cryptographic language compiler

» Rijndael for Sensor Networks Is Speed the Main Issue

» The price of security in wireless sensor networks

Post Info
More Details (n/a)

Added	09 Aug 2010
Updated	09 Aug 2010
Type	Conference
Year	1994
Where	FSE
Authors	David J. Wheeler, Roger M. Needham

Comments (0)