An Analaysis on Quantum Implementation ofLightweiht Hash Algorithm

Date

2025-9-5

Author

Akkocaoğlu, Hande

Metadata

Show full item record

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

Item Usage Stats

4534
views

139
downloads

Cite This

The rapid advancements in quantum technologies have introduced significant threats to the security of conventional cryptographic systems. In particular, the evaluation of quantum resource requirements—measured in terms of circuit depth and qubit count—has become essential for analyzing the resilience of widely used schemes such as AES and RSA, as well as cryptographic hash functions like SHA-2. At the same time, the widespread adoption of Internet of Things (IoT) applications has increased the exposure to cybersecurity risks, which are further exacerbated by the emerging capabilities of quantum adversaries. To address these challenges, the U.S. National Institute of Standards and Technology (NIST) launched a competition to standardize lightweight hash functions and defined five quantum security levels to assess their robustness. In this work, we conduct a resource analysis of the NIST Lightweight Hash Function finalists against the Grover search algorithm, providing detailed insights into their quantum resistance. The findings contribute to a more comprehensive understanding of the security strength of lightweight hash functions in the post-quantum era.

Subject Keywords

Quantum computing, NIST lightweight hash functions, Grover Algorithm, Kuantum hesaplama, NIST hafif sıklet özet fonksiyonları, Grover Algoritması

URI

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

Collections

Graduate School of Applied Mathematics, Term Project