GPU-Based Brute Force Cryptanalysis of KLEIN

Cihangir Tezcan

2024

Abstract

KLEIN is a family of lightweight block ciphers that supports 64-bit, 80-bit, and 96-bit secret keys. In this work, we provide a CUDA optimized table-based implementation of the KLEIN family which does not contain shared memory bank conflicts. Our best optimization reach more than 45 billion 64-bit KLEIN key searches on an RTX 4090. Our results show that KLEIN block cipher is susceptible to brute force attacks via GPUs. Namely, in order to break KLEIN in a year via brute force, one needs around 13, 1.34 million, and 111 billion RTX 4090 GPUs for 64-bit, 80-bit, and 96-bit secret keys, respectively. We recommend lightweight designs to avoid short keys.

Paper Citation

in Harvard Style

Tezcan C. (2024). GPU-Based Brute Force Cryptanalysis of KLEIN. In Proceedings of the 10th International Conference on Information Systems Security and Privacy - Volume 1: ICISSP; ISBN 978-989-758-683-5, SciTePress, pages 884-889. DOI: 10.5220/0012461900003648

in Bibtex Style

@conference{icissp24,
author={Cihangir Tezcan},
title={GPU-Based Brute Force Cryptanalysis of KLEIN},
booktitle={Proceedings of the 10th International Conference on Information Systems Security and Privacy - Volume 1: ICISSP},
year={2024},
pages={884-889},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0012461900003648},
isbn={978-989-758-683-5},
}

in EndNote Style

TY - CONF

JO - Proceedings of the 10th International Conference on Information Systems Security and Privacy - Volume 1: ICISSP
TI - GPU-Based Brute Force Cryptanalysis of KLEIN
SN - 978-989-758-683-5
AU - Tezcan C.
PY - 2024
SP - 884
EP - 889
DO - 10.5220/0012461900003648
PB - SciTePress