Observations on TETRA Encryption Algorithm TEA-3

Authors

  • Jens Alich Ruhr University Bochum, Bochum, Germany
  • Amund Askeland University of Bergen, Bergen, Norway
  • Subhadeep Banik Universita della Svizzera Italiana, Lugano, Switzerland
  • Tim Beyne COSIC, KU Leuven, Leuven, Belgium
  • Anne Canteaut Inria, Paris, France
  • Patrick Felke University of Applied Sciences Emden/Leer, Emden, Germany
  • Gregor Leander Ruhr University Bochum, Bochum, Germany
  • Willi Meier University of Applied Sciences and Arts Northwestern Switzerland, Windisch, Switzerland
  • Lukas Stennes Ruhr University Bochum, Bochum, Germany

DOI:

https://doi.org/10.46586/tosc.v2025.i1.276-308

Keywords:

TETRA, TEA-3, Stream cipher, Cryptanalysis, ETSI

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.

Downloads

Published

2025-03-07

Issue

Section

Articles

How to Cite

Alich, J., Askeland, A., Banik, S., Beyne, T., Canteaut, A., Felke, P., Leander, G., Meier, W., & Stennes, L. (2025). Observations on TETRA Encryption Algorithm TEA-3. IACR Transactions on Symmetric Cryptology, 2025(1), 276-308. https://doi.org/10.46586/tosc.v2025.i1.276-308