The digitization of our daily lives, driven by the Internet of Things (IoT) and other applications, has heightened the importance of data security. This paper explores the impact of quantum computing on password security, specifically focusing on Grover’s algorithm’s application to password cracking. We compare classical brute-force methods with quantum search techniques, utilizing real-world password data from significant breaches such as LinkedIn, 000webhost, and RockYou. Our study involves the development of a tool that tests password robustness using both classical and quantum simulations, and also generates secure passwords based on quantum randomness. The results obtained provide an insight into the application of quantum simulators for the implementation of quantum algorithms. They also illustrate how quantum random number generation helps to improve password security.
The digitization of our daily lives, driven by the Internet of Things (IoT) and other applications, has heightened the importance of data security. This paper explores the impact of quantum computing on password security, specifically focusing on Grover’s algorithm’s application to password cracking. We compare classical brute-force methods with quantum search techniques, utilizing real-world password data from significant breaches such as LinkedIn, 000webhost, and RockYou. Our study involves the development of a tool that tests password robustness using both classical and quantum simulations, and also generates secure passwords based on quantum randomness. The results obtained provide an insight into the application of quantum simulators for the implementation of quantum algorithms. They also illustrate how quantum random number generation helps to improve password security.
The Internet of Things (IoT) now underpins critical systems like healthcare monitors, smart home, smart grids, automotive V2V & V2X networks, and industrial controls but it still relies on classical cryptography, whose security assumptions are vulnerable to quantum computers. A large quantum computer could run Shor’s algorithm to break RSA/ECC and use Grover’s algorithm to accelerate brute-forcing of symmetric keys, undermining the confidentiality and authentication of data in these IoT applications. Researchers have proposed quantum cryptographic solutions. Quantum key distribution (QKD) and quantum random number generators (QRNGs) exploit quantum mechanics to detect eavesdropping and deliver provably secure key material. For example, chip-scale QRNGs can be embedded in IoT sensors to generate true random keys, boosting resistance to brute-force attacks. These quantum techniques provide information-theoretic secrecy, for instance, QKD-generated keys have been used to authenticate smart-grid SCADA. However, most IoT devices are resource-constrained, making direct deployment of conventional QKD hardware challenging. Post-quantum cryptography (PQC) complements quantum methods by providing algorithms such as lattice-based, hash-based that resist quantum attacks on existing hardware. Standardized PQC can be deployed via software updates on legacy IoT nodes, enabling scalable and quantum-safe security within current constraints. Researchers are exploring lightweight PQC for connected cars and e-health sensors. Hybrid approaches combining QKD/QRNG with PQC offer a layered defense. Since QKD protocols are regarded as ‘future-proof’ and PQC standards mature, their combined use will be essential for robust, quantum-safe IoT security. Miniaturizing quantum components such as integrated QKD/QRNG modules and optimizing lightweight PQC schemes for low-power IoT devices are future research directions to secure IoT networks.
Passwords remain a universal mechanism for user authentication, yet they are troubled by weak choices and vulnerabilities. The arrival of quantum computing threatens to worsen these issues by enabling faster password cracking. Conventional wisdom suggests using longer or more complex passwords to counter quantum attacks, but this approach can be impractical.In this paper, we propose a novel quantum-resistant password generation framework that leverages a Quantum Neural Network (QNN) to create highly secure passwords. Our approach combines quantum machine learning with entropy-based rigorous analysis to ensure that generated passwords are resilient even against adversaries equipped with quantum computing capabilities. We design and train a QNN using large-scale password datasets (including RockYou, Have I Been Pwned, and others) to learn the distribution of common passwords and then generate passwords that avoid these patterns. To rigorously quantify security, we replace simplistic entropy estimations with a von Neumann entropy analysis, measuring the quantum entropy of the password generation process. The experimental results demonstrate that our QNN-generated passwords achieve significantly higher entropy and resistance to guessing attacks compared to conventional methods. This research highlights how quantum computing can be harnessed not only as a threat but as a tool to enhance security.
Grover's Algorithm is a prominent quantum search algorithm in the rapidly advancing quantum computing study. By exploiting superposition and quantum parallelism, it has the potential to outperform classical brute-force approaches. Nevertheless, the current practical application of quantum technology in decrypting intricate passwords is restricted by its early stage, namely the restricted qubit quantities and short coherence durations. This work presents an innovative distributed quantum computing paradigm that addresses these difficulties by partitioning the password search space among several quantum processors. Each processor executes Grover's Algorithm on a subset of the search space, minimizing the computational complexity and quantum resource requirements for each individual processor. The partial findings are subsequently transmitted to a central classical computer, which amalgamates them to obtain the ultimate password. This distributed methodology not only allows for practicality with current quantum systems but also provides a scalable paradigm that can adapt to the progress of quantum computer technology. By decomposing the quantum brute-force search problem into smaller, more controllable elements, this approach can significantly decrease the time complexity of password retrieval, which has significant consequences for cryptography and cybersecurity.
Quantum computing can be regarded as a disruptive enabling technology that can pose a threat to traditional cryptography as it invented new approaches to encrypt data. This paper will compare the level of security that accompanies quantum algorithms as well as the level of efficiency. Specifically, we examine the impact of efficient quantum computing on traditional cryptography and propose techniques against quantum invasions. Four quantum algorithms are analyzed for their efficiency and security benefits in the post-quantum era: Grover’s Algorithm, Shor’s Algorithm, The Quantum Key Distribution (QKD), Lattice-based cryptography. The results reveal that Grover’s algorithm improves search time complexity from O(n) to O(√n), which is advantageous over large data sets. As it will be clear shortly, Shor’s algorithm challenges RSA encryption because it outperforms classical algorithms in factoring large integers. QKD presents secure key exchange protocols that cannot be breached notwithstanding the attempts made using quantum computing. Lattice-based schemes are quantum-resistant alternatives based on the security of certain hard mathematical problems. Based on our experimental results, computational efficiency can be improved, but new cryptographic systems will have to be developed for the mitigation of quantum-related vulnerabilities. This research shows the importance of quantum-resistant cryptographic techniques to ensure data security in the emerging quantum computing era.
This paper explores the design of cryptographic algorithms leveraging the inherent randomness of quantum random number generators (QRNGs). Traditional cryptographic algorithms often rely on pseudo-random number generators (PRNGs), which are deterministic and therefore vulnerable to attacks if their internal state is compromised. QRNGs, on the other hand, derive their randomness from quantum mechanical phenomena, offering a fundamentally unpredictable source of numbers. This research investigates the application of QRNGs to enhance cryptographic security, focusing on constructing algorithms that exploit this unique property. The core claim is that utilizing QRNG characteristics allows for the design of more secure cryptographic algorithms. The proposed mechanism involves capitalizing on the non-deterministic nature of QRNGs to build algorithms with heightened security levels. This approach presents a novel security guarantee method by incorporating true randomness into cryptographic processes. We examine specific algorithm designs and analyze their security implications compared to traditional PRNG-based approaches. The paper concludes with a discussion on the challenges and future directions of utilizing QRNGs in cryptography.
The rapid advancements in quantum computation pose significant threats to traditional cryptographic systems, such as those used in the Internet of Things (IoT). RSA and methods like Elliptic Curve Cryptography (ECC) are particularly vulnerable to quantum algorithmic techniques, such as Shor’s and Grover’s algorithms. This paper focuses on the analysis of cryptographic models based on quantum technologies, with special emphasis on IoT security. It examines how both symmetric and public-key cryptography are affected by quantum comput-ing—highlighting vulnerabilities in symmetric schemes to Grover’s algorithm and in public-key systems like ECC to Shor’s algorithm. Significant focus is placed on the advancement of quantum-resistant ECC, with an in-depth evaluation of its effectiveness, security capabilities, and suitability for IoT applications. This work also compares various methods for implementing quantum-enhanced ECC, considering both software and hardware solutions. Furthermore, the paper explores emerging hybrid systems that integrate classical and quantum-resistant encryption to offer enhanced security in transitional scenarios. Lastly, it outlines potential research avenues for developing new techniques to protect future IoT networks from quantum-based attacks.