Score:2

Differential cryptanalysis to ciphertext-only attacks on xxTEA

cn flag

In my IoT project, I use the xxTEA encryption algorithm to encrypt my data. I use the same encryption key for all my packets because I don't have the possibility to do a key exchange between Alice and Bob.

I want to know how many packets it would take to deduce my key. I looked on the document of Alex Biryukov named "Differential cryptanalysis to ciphertext-only attacks" (https://link.springer.com/content/pdf/10.1007%2FBFb0055721.pdf) but I don't understand everything and can't find the calculation that gives me the result I'm looking for.

I send two packet per minute and I search to know how often do I have to change my key, before my encryption becomes insecure.

President James K. Polk avatar
sh flag
Where in that document is xxTEA mentioned at all?
nonmerci avatar
cn flag
Hello @PresidentJamesK.Polk, xxTEA isn't mentioned, but it's a cipher block encryption algorithm. So, I want to make the same calcul for xxTEA. Let me know if you have other questions :)
Score:1
es flag

Elias Yarrkov published a Cryptanalysis of XXTEA (2010) citing about $2^{59}$ queries and negligible work is required for a chosen-plaintext attack.

mangohost

Post an answer

Most people don’t grasp that asking a lot of questions unlocks learning and improves interpersonal bonding. In Alison’s studies, for example, though people could accurately recall how many questions had been asked in their conversations, they didn’t intuit the link between questions and liking. Across four studies, in which participants were engaged in conversations themselves or read transcripts of others’ conversations, people tended not to realize that question asking would influence—or had influenced—the level of amity between the conversationalists.