Paper 2026/1007 Original: eprint.iacr.org/2026/1007 ↗
Quantum Circuit Implementation and Grover’s Search on the Lightweight Block Cipher KLEIN Family
Abstract
The continued advancement of quantum computing is expected to transform the landscape of cryptographic security, making many classical algorithms vulnerable to quantum attacks such as Grover’s exhaustive key search. In this study, we present an efficient quantum circuit implementation of the lightweight block cipher KLEIN for all variants. Each functional component of the cipher, such as key addition, substitution, RotateNibbles, MixNibbles, and key scheduling, is implemented. The complete quantum design involves gates such as CCNOT, CNOT, and Pauli-X. Furthermore, we provide a comprehensive resource estimate for executing Grover’s search algorithm on the proposed quantum circuits, highlighting their resilience and practicality in post-quantum cryptographic contexts.
Metadata
- Available format(s)
PDF- Category
- Implementation
- Publication info
- Preprint.
- History
- 2026-06-23: last updated
- 2026-05-20: published
- Short URL
- https://ia.cr/2026/1007
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2026/1007,
author = {Indranil Mukherjee and Ranit Dutta and Bhupendra Singh and Lexy Alexandar and Bimal Mandal},
title = {Quantum Circuit Implementation and Grover’s Search on the Lightweight Block Cipher KLEIN Family},
howpublished = {Cryptology {ePrint} Archive, Paper 2026/1007},
year = {2026},
url = {https://eprint.iacr.org/2026/1007}
}