In this paper, a cryptographic algorithm design called Tiny Encryption Algorithm (TEA) is proposed in order to minimize the memory footprint and maximize the speed. The design was targeted for embedded and mobile systems which concern more on speed and space. In TEA, the plaintext is encrypted and decrypted using the operations from mixed (orthogonal) algebraic groups and a huge number of rounds to achieve security with simplicity. At sixty-four (64) Feistel rounds, a total of 2,883 gates are used in the TEA encryption process with 16.72ns delay time while 2,805 gates are consumed in the decryption process with 14.78ns delay time. With these outcomes, the design is possible to be implemented on mobile devices which require considerable extent of security.
[1]
Bruce Schneier,et al.
Key-Schedule Cryptanalysis of DEAL
,
1999,
Selected Areas in Cryptography.
[2]
P. Israsena.
Securing ubiquitous and low-cost RFID using tiny encryption algorithm
,
2006,
2006 1st International Symposium on Wireless Pervasive Computing.
[3]
Roger M. Needham,et al.
TEA, a Tiny Encryption Algorithm
,
1994,
FSE.
[4]
Bruce Schneier,et al.
Related-Key Cryptanalysis of 3-WAY
,
1997
.
[5]
Bruce Schneier,et al.
Key-Schedule Cryptanalysis of IDEA, G-DES, GOST, SAFER, and Triple-DES
,
1996,
CRYPTO.