Paper 2024/2045 Original: eprint.iacr.org/2024/2045 ↗

Observations on TETRA Encryption Algorithm TEA-3

Jens Alich
Amund Askeland
Subhadeep Banik
Tim Beyne
Anne Canteaut
Patrick Felke
Gregor Leander
Willi Meier
Lukas Stennes
Abstract

We present a number of observations on TEA-3, a stream cipher used in TETRA radio networks that was kept secret until recently. While the same also holds for the six other TETRA encryption algorithms, we pick TEA-3 to start with, as (i) it is not obviously weakened as TEA-{1,4,7} but (ii) in contrast to TEA-2 it is approved for extra-European emergency service, and (iii) as already noted by [MBW23] the TEA-3 design surprisingly contains a non-bijective S-box. Most importantly, we show that the 80-bit non-linear feedback shift register operating on the key decomposes into a cascade of two 40-bit registers. Although this hints at an intentional weakness at first glance, we are not able to lift our results to a practical attack. Other than that, we show how the balanced non-linear feedback functions used in the state register of TEA-3 can be constructed.

Metadata
Available format(s)
PDF
Category
Secret-key cryptography
Publication info
Preprint.
History
2025-02-17: last updated
2024-12-18: published
Short URL
https://ia.cr/2024/2045
License
https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2024/2045,
      author = {Jens Alich and Amund Askeland and Subhadeep Banik and Tim Beyne and Anne Canteaut and Patrick Felke and Gregor Leander and Willi Meier and Lukas Stennes},
      title = {Observations on TETRA Encryption Algorithm TEA-3},
      howpublished = {Cryptology {ePrint} Archive, Paper 2024/2045},
      year = {2024},
      url = {https://eprint.iacr.org/2024/2045}
}
Note: In order to protect the privacy of readers, this archive does not use cookies or embedded third party content.