A5/3 make or break: A massively parallel FPGA architecture for exhaustive key search
In this paper, we have designed and implemented a massively parallel FPGA architecture for exhaustive key search on the A5/3 encryption algorithm. A5/3 is based on KASUMI, it has an effective key of 64 bits, and it is used in GSM (2G) mobile telephony systems. Despite the widespread adoption of mor...
Saved in:
| Main Authors: | Konstantina Miteloudi, Lejla Batina, Nele Mentens |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Ruhr-Universität Bochum
2025-06-01
|
| Series: | Transactions on Cryptographic Hardware and Embedded Systems |
| Subjects: | |
| Online Access: | https://tches.iacr.org/index.php/TCHES/article/view/12220 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
GPU Assisted Brute Force Cryptanalysis of GPRS, GSM, RFID, and TETRA
by: Cihangir Tezcan, et al.
Published: (2025-03-01) -
Advancements in cyberthreat intelligence through resource exhaustion attack detection using hybrid deep learning with heuristic search algorithms
by: S. Jayanthi, et al.
Published: (2025-08-01) -
Analysis of possibilities of FPGA-implementation for multiplication operations in the Galois field
by: E. V. Listopad
Published: (2019-06-01) -
An Accelerated FPGA-Based Parallel CNN-LSTM Computing Device
by: Xin Zhou, et al.
Published: (2024-01-01) -
A High-Entropy True Random Number Generator with Keccak Conditioning for FPGA
by: Valeria Piscopo, et al.
Published: (2025-03-01)