Questions tagged [tea]

Tiny Encryption Algorithm (TEA) is a block cipher by David Wheeler and Roger Needham of the Cambridge Computer Laboratory; notable for its simplicity of description and implementation.

Filter by
Sorted by
Tagged with
4
votes
0answers
118 views

How sensitive is Tiny Encryption Algorithm (TEA) to the magic numbers?

If I needed to implement an encryption algorithm from memory, chances are I would try to implement: TEA https://en.wikipedia.org/wiki/Tiny_Encryption_Algorithm How sensitive is it to the magic ...
5
votes
1answer
306 views

Why are there so many versions of the TEA block cipher?

Why are there so many types of TEA, for example TEA, XTEA, and XXTEA? What are the differences?
4
votes
2answers
215 views

Is this algorithm good enough for small radio messages?

This question is related to: How to implement security - authenticity/confidentiality/integrity for 6/14 bits radio messages? I am looking for a message that an attacker listening to the radio ...
2
votes
2answers
705 views

Tiny Encryption Algorithm (TEA) weakness

The Wikipedia states that different multiples of a magic constant are used to prevent simple attacks based on the symmetry of the rounds. The magic constant, ...
1
vote
2answers
286 views

How do I check if the output of my CFB TEA encryption algorithm is correct?

I have an assignment question regarding the TEA cipher in CFB mode. After much difficulty and research, I managed to produce an 8-bit TEA / CFB encryption algorithm. My input is supposed to be a ...
0
votes
1answer
259 views

How many bits shift is a TEA encryption?

...
15
votes
1answer
5k views

Is TEA considered secure?

Wikipedia claims that the best attack on the surprisingly simple TEA block cipher, that isn't a related-key attack, has a time complexity of $2^{121.5}$. So despite how unsophisticated the cipher ...
6
votes
1answer
441 views

Low complexity implementation of a small blocksize cipher (< 64 bit)

Searching for "small blocksize cipher" finds a number of discussions on the topic, mostly refering to FPE. This one in particular suggests using AES as the round function of a Feistel network. The ...
4
votes
3answers
2k views

Hash function in PBKDF2

From this excellent answer I learned (correct me if I am wrong) that when writing a block cipher with say key size 128 bit, one has to pad the password given (variable size) so that it becomes exactly ...