Sciweavers

7 search results - page 1 / 2
» TEA, a Tiny Encryption Algorithm
Sort
View
ACMSE
2004
ACM
13 years 10 months ago
Implementing the TEA algorithm on sensors
Sensors are tiny computers with limited computational capability and physical resources. The implementation of secure protocols for sensor network is a big challenge. In order to ...
Shuang Liu, Olga V. Gavrylyako, Phillip G. Bradfor...
FSE
1994
Springer
145views Cryptology» more  FSE 1994»
13 years 8 months ago
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.
David J. Wheeler, Roger M. Needham
EGH
2010
Springer
13 years 2 months ago
GPU random numbers via the tiny encryption algorithm
Random numbers are extensively used on the GPU. As more computation is ported to the GPU, it can no longer be treated as rendering hardware alone. Random number generators (RNG) a...
Fahad Zafar, Marc Olano, Aaron Curtis
LPAR
2005
Springer
13 years 10 months ago
Functional Correctness Proofs of Encryption Algorithms
Abstract. We discuss a collection of mechanized formal proofs of symmetric key block encryption algorithms (AES, MARS, Twofish, RC6, Serpent, IDEA, and TEA), performed in an imple...
Jianjun Duan, Joe Hurd, Guodong Li, Scott Owens, K...
ACL2
2006
ACM
13 years 10 months ago
A verifying core for a cryptographic language compiler
A verifying compiler is one that emits both object code and a proof of correspondence between object and source code.1 We report the use of ACL2 in building a verifying compiler f...
Lee Pike, Mark Shields, John Matthews