GPU Assisted Brute Force Cryptanalysis of GPRS, GSM, RFID, and TETRA Brute Force Cryptanalysis of KASUMI, SPECK, and TEA3

Date

2025-03-07

Author

Tezcan, Cihangir
Leander, Gregor

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

23
views

0
downloads

Cite This

Key lengths in symmetric cryptography are determined with respect to the brute force attacks with current technology. While nowadays at least 128-bit keys are recommended, there are many standards and real-world applications that use shorter keys. In order to estimate the actual threat imposed by using those short keys, precise estimates for attacks are crucial. In this work we provide optimized implementations of several widely used algorithms on GPUs, leading to interesting insights on the cost of brute force attacks on several real-word applications. In particular, we optimize KASUMI (used in GPRS/GSM), SPECK (used in RFID communication), and TEA3 (used in TETRA). Our best optimizations allow us to try 235.72, 236.72, and 234.71 keys per second on a single RTX 4090 GPU. Those results improve upon previous results significantly, e.g. our KASUMI implementation is more than 15 times faster than the optimizations given in the CRYPTO’24 paper [ACC+ 24] improving the main results of that paper by the same factor. With these optimizations, in order to break GPRS/GSM, RFID, and TETRA communications in a year, one needs around 11, 22 billion, and 1.36 million RTX 4090 GPUs, respectively. For KASUMI, the time-memory trade-off attacks of [ACC+ 24] can be performed with 142 RTX 4090 GPUs instead of 2400 RTX 3090 GPUs or, when the same amount of GPUs are used, their table creation time can be reduced to 20.6 days from 348 days, crucial improvements for real world cryptanalytic tasks.

Subject Keywords

A5/3, cryptanalysis, GPU, KASUMI, SPECK, TEA3

URI

https://hdl.handle.net/11511/114354

Collections

Graduate School of Informatics, Article