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.
The Brassard–Høyer–Tapp (BHT) algorithm, introduced in 1997, demonstrates that cryptographic-hash collisions can be located with lower computational cost than classical brute-force search. Yet, no experimental realization of BHT for hash-function cryptanalysis on an actual quantum processor has been reported. In this paper, we present practical implementation and in-depth analysis of BHT applied to a lightweight cryptographic hash on IBM’s quantum hardware. Using Qiskit, we design the quantum circuit for the target hash and embed the BHT subroutines. Our results quantify both the algorithmic complexity and the number of qubit required for successful collision discovery, and they provide a roadmap for extending the technique to real-world hash functions once quantum resources scale to the necessary size.
Quantum cryptanalysis methods are used to crack the majority of symmetric key ciphers. With this knowledge, cryptologists should be able to create post-quantum symmetric ciphers by incorporating these new quantum cryptanalysis techniques into their toolkit. Secure communication is crucial for applications related to the Internet of Things (IoT) to avoid cyberattacks. Cryptographic hash functions can be used to protect data integrity. The development of large-scale, fault-tolerant quantum computers is the most significant challenge. Recent techniques to attack symmetric key schemes can be achieved by using the Pre-image attack method, Simon’s algorithm, or by combining Simon’s and Grover’s algorithms. In this study, we explored some of the most recent methods for quantum cryptanalysis of symmetric key ciphers. Firstly, we discussed the design of quantum cryptanalysis methods, along with the advantages over classical procedures. In this paper, we illustrate the implementation of the NIST-standard lightweight hash function PHOTON-Beetle on a Quantum Computer (using IBM Qiskit), which is mostly used in IoT devices. Efficient quantum implementation of PHOTON-Beetle is proposed in this paper. This paper calculates the quantum cost of PHOTON-Beetle for every layer and compares it with [1].