Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

SN Computer Science

Quantum Adaptation of SHA-1 and MD5: Implementation, Performance Evaluation, and Discussion on Post-Quantum Hashing Techniques

Prodipto Das, Sumit Biswas, Sandip Kanoo

Published Oct 22, 2025• 0 citations
Publisher
DOI
10.1007/s42979-025-04394-3

Related papers

Quantum implementation of SHA1 and MD5 and comparison with classical algorithms

Prodipto Das, Sumit Biswas, Sandip Kanoo

Quantum Information Processing•May 9, 2024•8 citations

Design and Comparative Analysis of Quantum Hashing Algorithms using Qiskit

Prodipto Das

This research explores the quantum implementation of three crucial hashing algorithms, namely Secure Hash Algorithm 1 (SHA-1), Message Digest 5 (MD5), and Secure Hash Algorithm 256 (SHA-256), within the context of network security for future networks.Quantum Cryptography, an emerging field, combines Cryptology and Cryptanalysis, presenting exciting prospects for secure communication.Our study focuses on the design and implementation of SHA-1, MD5, and SHA-256 algorithms specifically tailored for Quantum Computers.The primary objective is to investigate the time required to construct a hash and the bit rate at which a hash value can be transmitted.A comprehensive analysis of these three quantum algorithms is performed, with a particular emphasis on their performance in comparison to their classical counterparts.Experimental comparisons reveal that the execution time for qSHA-1, qMD5 and qSHA-256 significantly exceeds that of classical parts.Notably, our findings indicate a dependency of the implemented algorithms' execution time on the processor's speed.This research sheds light on the potential capabilities of quantum algorithms in the realm of network security and contributes valuable insights to the ongoing discussions surrounding quantum cryptography.An intriguing discovery arising from this study is the observation that quantum MD5 exhibits quicker execution times than quantum SHA-1 and quantum SHA-256.However, contrasting the classical scenario, where cSHA-1 demonstrates quicker execution than cMD5 and cSHA-256, it becomes evident that classical and quantum performance across these algorithms diverges markedly.This highlights a notable contrast in the behavior of these algorithms, thereby underscoring the potential dissimilarity rather than similarity between classical and quantum performances.The results underscore the need for further exploration to optimize the performance of quantum hashing algorithms, ensuring their viability in practical applications for future networks.

•Aug 28, 2023•2 citations

Quantum Implementation of SHA-1

Seyoung Yoon, Gyeongju Song, Kyungbae Jang +2 more

Lecture notes in computer science•Jan 1, 2026•0 citations

Improved Quantum Cryptanalysis of MD5 and SHA-1

Kyungbae Jang, Hwajeong Seo, Anupam Chattopadhyay

MD5 and SHA-1 are widely studied hash functions in cryptanalysis, owing to their well-structured round functions and historical significance in cryptography. This paper presents improved quantum circuit implementations of MD5 and SHA-1 specifically optimized for quantum cryptanalysis. We reduce the quantum implementation cost of auxiliary functions and eliminate the use of ancilla qubits, while reducing circuit depth (the number of sequential gate layers) by parallelizing multiple additions in the round operations of MD5 and SHA-1. Additionally, the quantum implementations of MD5 and SHA-1 are optimized by considering a fixed input size under the attack scenario. The proposed implementations achieve a 63% improvement in the depth - qubit count metric for MD5 and a 27% improvement for SHA-1 compared to previous works. By providing reduced quantum resources, this work establishes an improved baseline for the quantum cryptanalysis of MD5 and SHA-1. We analyze quantum attacks on MD5 and SHA-1, showing that the preimage attacks require a full depth of 279 and 296 for MD5 and SHA-1, respectively, while the collision attacks require a full depth of 254 and 264. For a realistic evaluation, we also estimate the quantum resources for fault-tolerant quantum computation, including the number of physical qubits and the runtime, to break MD5 and SHA-1.

IEEE Access•Jan 1, 2026•1 citation

Applying Grover's Algorithm to Hash Functions: A Software Perspective

Richard H. Preston

Quantum software frameworks provide software engineers with the tools to study quantum algorithms as applied to practical problems. We implement classical hash functions MD5, SHA-1, SHA-2, and SHA-3 as quantum oracles to study the computational resource requirements of conducting a preimage attack with Grover's Algorithm. We introduce an improvement to the SHA-3 oracle that reduces the number of logical qubits required in the Keccak block permutation by 40%. The source code is available athttps://github.com/rhpreston/grovers-hash-functions.

arXiv:2202.10982•IEEE Transactions on Quantum Engineering•Jan 1, 2022•46 citations

Efficient Algorithms for Quantum Hashing

I. Zinnatullin, Kamil Ravilevich Khadiev

arXiv:2507.07002•Lecture notes in computer science•Jan 1, 2026•5 citations
This research explores the quantum implementation of three crucial hashing algorithms, namely Secure Hash Algorithm 1 (SHA-1), Message Digest 5 (MD5), and Secure Hash Algorithm 256 (SHA-256), within the context of network security for future networks.Quantum Cryptography, an emerging field, combines Cryptology and Cryptanalysis, presenting exciting prospects for secure communication.Our study focuses on the design and implementation of SHA-1, MD5, and SHA-256 algorithms specifically tailored for Quantum Computers.The primary objective is to investigate the time required to construct a hash and the bit rate at which a hash value can be transmitted.A comprehensive analysis of these three quantum algorithms is performed, with a particular emphasis on their performance in comparison to their classical counterparts.Experimental comparisons reveal that the execution time for qSHA-1, qMD5 and qSHA-256 significantly exceeds that of classical parts.Notably, our findings indicate a dependency of the implemented algorithms' execution time on the processor's speed.This research sheds light on the potential capabilities of quantum algorithms in the realm of network security and contributes valuable insights to the ongoing discussions surrounding quantum cryptography.An intriguing discovery arising from this study is the observation that quantum MD5 exhibits quicker execution times than quantum SHA-1 and quantum SHA-256.However, contrasting the classical scenario, where cSHA-1 demonstrates quicker execution than cMD5 and cSHA-256, it becomes evident that classical and quantum performance across these algorithms diverges markedly.This highlights a notable contrast in the behavior of these algorithms, thereby underscoring the potential dissimilarity rather than similarity between classical and quantum performances.The results underscore the need for further exploration to optimize the performance of quantum hashing algorithms, ensuring their viability in practical applications for future networks.
MD5 and SHA-1 are widely studied hash functions in cryptanalysis, owing to their well-structured round functions and historical significance in cryptography. This paper presents improved quantum circuit implementations of MD5 and SHA-1 specifically optimized for quantum cryptanalysis. We reduce the quantum implementation cost of auxiliary functions and eliminate the use of ancilla qubits, while reducing circuit depth (the number of sequential gate layers) by parallelizing multiple additions in the round operations of MD5 and SHA-1. Additionally, the quantum implementations of MD5 and SHA-1 are optimized by considering a fixed input size under the attack scenario. The proposed implementations achieve a 63% improvement in the depth - qubit count metric for MD5 and a 27% improvement for SHA-1 compared to previous works. By providing reduced quantum resources, this work establishes an improved baseline for the quantum cryptanalysis of MD5 and SHA-1. We analyze quantum attacks on MD5 and SHA-1, showing that the preimage attacks require a full depth of 279 and 296 for MD5 and SHA-1, respectively, while the collision attacks require a full depth of 254 and 264. For a realistic evaluation, we also estimate the quantum resources for fault-tolerant quantum computation, including the number of physical qubits and the runtime, to break MD5 and SHA-1.
Quantum software frameworks provide software engineers with the tools to study quantum algorithms as applied to practical problems. We implement classical hash functions MD5, SHA-1, SHA-2, and SHA-3 as quantum oracles to study the computational resource requirements of conducting a preimage attack with Grover's Algorithm. We introduce an improvement to the SHA-3 oracle that reduces the number of logical qubits required in the Keccak block permutation by 40%. The source code is available athttps://github.com/rhpreston/grovers-hash-functions.