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

International Journal of Health Sciences

implementation of modified blowfish using random number generator for quantum computers

Shipra Srivastava, Anoop Kumar Tiwari, Ramveer Singh

Published May 30, 2022• 0 citations
Publisher

Abstract

Classical computers are quite safe from attacks by implementing traditional cryptographic techniques and algorithms but in future as quantum computers will come in full fledge, our current cryptographic algorithms will become vulnerable. In this paper authors have presented a modified blowfish scheme named as pseudo random generated blowfish encryption algorithm which can provide security to our data quantum computers also. Analysis of algorithm is done on classical computer as well as on quantum simulators (IBM qx) and result of comparison is also presented. The theoretical security measures are also discussed in this paper.

DOI
10.53730/ijhs.v6ns1.8121

Related papers

Quantum Random Number Generator-Based Cryptographic Algorithm Design

Jincheng Zhang

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.

•Sep 1, 2026•0 citations

Quantum Safe Cryptography using Modern Hybrid Cryptography Techniques to Secure Data

Gurjit Singh Bhathal, Udaibir Singh Bhathal

Cryptography, the practice of concealing messages for private exchange, has evolved significantly to address the challenges posed by new communication methods. In today`s digital world, cryptography has become the cornerstone of cybersecurity, using advanced mathematics like number theory and computational complexity to protect digital information through algorithms. The upcoming arrival of quantum computers poses a serious threat to traditional cryptographic methods, especially those based on asymmetric key cryptography. Quantum Safe Cryptography (QSC) represents the next step in information security, designed to develop cryptographic systems that can withstand attacks from both quantum and classical computers. As quantum computing moves from theory to reality, it`s becoming clear that current cryptographic methods based on integer factorization and discrete logarithm problems are vulnerable to quantum algorithms like Shor`s algorithm. This study highlights the security risks that quantum computing poses to existing encryption methods and proposes a comprehensive approach to quantum-safe cryptography. The transition to quantum-resistant algorithms involves replacing vulnerable cryptographic systems with alternatives that can resist quantum computational attacks. Current analysis shows that while asymmetric key cryptography faces immediate vulnerability, symmetric key algorithms and hash functions remain relatively secure in the near term with appropriate adjustments. Quantum cryptography, which directly uses quantum mechanical principles, offers highly secure encryption mechanisms, notably Quantum Key Distribution (QKD). This research aims to enhance the security of digital infrastructure against quantum threats by evaluating hybrid cryptographic implementations that combine classical and quantum-resistant approaches for optimal security.

International Journal of Computer Sciences and Engineering•Apr 30, 2025•0 citations

Merging Quantum Entropy with Classical Speed: Design and Evaluation of a Hybrid Random Number Generator for Secure Encryption

Verren Angle Ng, Marshia Haunafi, Andira Dinda Larasathi +1 more

Over the past few years, quantum computing has been evolving, raising concerns about how long our existing encryption methods will remain reliable. Given this, random number generators that are both high entropy and secure from quantum threats are needed. In this research, we present a hybrid random number generator system designed to produce quantum-resistant cryptographic keys to mitigate the risk of future quantum adversaries. This HRNG design integrates true entropy of a quantum random number generator (QRNG) and combines it with the high-speed performance of a ChaCha20-based pseudo random number generator (PRNG). This approach successfully balances the speed of classical algorithms with quantum unpredictability. When integrated with symmetric (AES, Blowfish, Triple DES, IDEA) and asymmetric (RSA, ECC) encryption algorithms, it maintained high-speed encryption performance without any difficulties from the limitations of physical QRNG. By avoiding hardware constraints and performance bottlenecks, the HRNG provides a deployable entropy solution that easily integrates into existing cryptographic systems.

International Seminar on Research of Information Technology and Intelligent Systems (ISRITI)•Dec 11, 2025•0 citations

WITHDRAWN: Implementation of Encryption Algorithms in Classical and Quantum Computing: A comparative Analysis

Jayavrinda Vrindavanam Akshay, Anirudh Narayanan, N. Chandrashekar +2 more

Abstract In the overall context of enhanced application of quantum computing into multitude of areas, the paper explores and implements classical encryption algorithms both in traditional and quantum computing environments. Towards this, the classical encryption algorithms such as Blowfish, RSA and ECC are executed in both classical and quantum environments. The result shows that the key generated in the classical hardware is limited to 64-bit as envisaged; the quantum key is generated found to be complex as the instruction set changes from classical instruction set to quantum instruction set. Further, the additional factor of randomness in quantum computing increases the security of the cipher text, which is transmitted over the internet, showing insights for practical applications.

•Apr 16, 2024•1 citation

Quantum Random Numbers: A Survey on Sources, Numerical Evidence, and Applications in Security and Computing

Sebastian Raubitzek, Stefan Mühlhauser, Kevin Mallinger

Random numbers are used to generate cryptographic keys, to run Monte Carlo simulations, and to train and sample machine learning models. Most software obtains them from deterministic pseudo-random number generators, which have good statistical properties but are predictable once their internal state is known. Quantum random number generators take their output from measurements on quantum systems, whose outcomes are not fixed by any prior state of the device. This article introduces the types of random number generators, reviews studies that compare quantum and pseudo-random numbers in numerical experiments, and lists the sources of randomness available in current computing systems. It then describes applications of quantum randomness in security, hashing, software, artificial intelligence, and public randomness. The quality of encryption is treated as depending on three factors: the algorithm, its implementation, and the randomness of keys and other security-relevant values. We give arguments for which applications benefit from quantum randomness, name further areas in which it could be tested, and outline next steps.

Entropy•Nov 10, 2026•0 citations

Efficient Quantum Algorithm for Post Quantum Cryptography

Aswini Kumar Mallick, Puspak Pain, Kunal Das +4 more

The realization of Quantum computers could significantly affect society and global security in many ways. A considerable amount of research has been on quantum cryptography - machines that exploit quantum computerized sensations to solve mathematical problems inaccessible to conventional computers. The flourishing 6th generation of 'Quantum computing' can break and threaten much of the current established protection and digital economy, but may provide cryptographic alternatives. Thus, we are able to optimize various processes more effectively, improving efficiency and enabling faster quantum mechanical simulations for better drug and material design, among other applications. This research focuses on implementing a post-quantum cryptographic algorithm by connecting large-number Quantum multiplication with a quantum random number generator (QRNG). A code-based cryptographic approach using a Quantum Fourier Transformation (QFT) is taken with a giant asymmetric key in an explicit quantum circuit to establish a secure quantum communication system. In this research work, a 'plain text' (classical data) has been encrypted with QRNG using a Quantum multiplier with the aid of quantum arithmetic. Consequently, the resultant quantum data with QRNG data will be transmitted to the receiver end through the quantum channel, where the quantum divider decrypts the same. Furthermore, each intended component's IBM Qiskit simulation results and comparative analysis with previous works and algorithms suggest more robustness and reliability of the proposed quantum proof algorithm when considering large qubit quantum devices. The work provides a valuable direction for further developments in this domain and paves the way for future applications of quantum computing in post-quantum cryptography.

Journal of Visualized Experiments•Nov 14, 2025•0 citations
Classical computers are quite safe from attacks by implementing traditional cryptographic techniques and algorithms but in future as quantum computers will come in full fledge, our current cryptographic algorithms will become vulnerable. In this paper authors have presented a modified blowfish scheme named as pseudo random generated blowfish encryption algorithm which can provide security to our data quantum computers also. Analysis of algorithm is done on classical computer as well as on quantum simulators (IBM qx) and result of comparison is also presented. The theoretical security measures are also discussed in this paper.
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.
Cryptography, the practice of concealing messages for private exchange, has evolved significantly to address the challenges posed by new communication methods. In today`s digital world, cryptography has become the cornerstone of cybersecurity, using advanced mathematics like number theory and computational complexity to protect digital information through algorithms. The upcoming arrival of quantum computers poses a serious threat to traditional cryptographic methods, especially those based on asymmetric key cryptography. Quantum Safe Cryptography (QSC) represents the next step in information security, designed to develop cryptographic systems that can withstand attacks from both quantum and classical computers. As quantum computing moves from theory to reality, it`s becoming clear that current cryptographic methods based on integer factorization and discrete logarithm problems are vulnerable to quantum algorithms like Shor`s algorithm. This study highlights the security risks that quantum computing poses to existing encryption methods and proposes a comprehensive approach to quantum-safe cryptography. The transition to quantum-resistant algorithms involves replacing vulnerable cryptographic systems with alternatives that can resist quantum computational attacks. Current analysis shows that while asymmetric key cryptography faces immediate vulnerability, symmetric key algorithms and hash functions remain relatively secure in the near term with appropriate adjustments. Quantum cryptography, which directly uses quantum mechanical principles, offers highly secure encryption mechanisms, notably Quantum Key Distribution (QKD). This research aims to enhance the security of digital infrastructure against quantum threats by evaluating hybrid cryptographic implementations that combine classical and quantum-resistant approaches for optimal security.
Over the past few years, quantum computing has been evolving, raising concerns about how long our existing encryption methods will remain reliable. Given this, random number generators that are both high entropy and secure from quantum threats are needed. In this research, we present a hybrid random number generator system designed to produce quantum-resistant cryptographic keys to mitigate the risk of future quantum adversaries. This HRNG design integrates true entropy of a quantum random number generator (QRNG) and combines it with the high-speed performance of a ChaCha20-based pseudo random number generator (PRNG). This approach successfully balances the speed of classical algorithms with quantum unpredictability. When integrated with symmetric (AES, Blowfish, Triple DES, IDEA) and asymmetric (RSA, ECC) encryption algorithms, it maintained high-speed encryption performance without any difficulties from the limitations of physical QRNG. By avoiding hardware constraints and performance bottlenecks, the HRNG provides a deployable entropy solution that easily integrates into existing cryptographic systems.
Abstract In the overall context of enhanced application of quantum computing into multitude of areas, the paper explores and implements classical encryption algorithms both in traditional and quantum computing environments. Towards this, the classical encryption algorithms such as Blowfish, RSA and ECC are executed in both classical and quantum environments. The result shows that the key generated in the classical hardware is limited to 64-bit as envisaged; the quantum key is generated found to be complex as the instruction set changes from classical instruction set to quantum instruction set. Further, the additional factor of randomness in quantum computing increases the security of the cipher text, which is transmitted over the internet, showing insights for practical applications.
Random numbers are used to generate cryptographic keys, to run Monte Carlo simulations, and to train and sample machine learning models. Most software obtains them from deterministic pseudo-random number generators, which have good statistical properties but are predictable once their internal state is known. Quantum random number generators take their output from measurements on quantum systems, whose outcomes are not fixed by any prior state of the device. This article introduces the types of random number generators, reviews studies that compare quantum and pseudo-random numbers in numerical experiments, and lists the sources of randomness available in current computing systems. It then describes applications of quantum randomness in security, hashing, software, artificial intelligence, and public randomness. The quality of encryption is treated as depending on three factors: the algorithm, its implementation, and the randomness of keys and other security-relevant values. We give arguments for which applications benefit from quantum randomness, name further areas in which it could be tested, and outline next steps.
The realization of Quantum computers could significantly affect society and global security in many ways. A considerable amount of research has been on quantum cryptography - machines that exploit quantum computerized sensations to solve mathematical problems inaccessible to conventional computers. The flourishing 6th generation of 'Quantum computing' can break and threaten much of the current established protection and digital economy, but may provide cryptographic alternatives. Thus, we are able to optimize various processes more effectively, improving efficiency and enabling faster quantum mechanical simulations for better drug and material design, among other applications. This research focuses on implementing a post-quantum cryptographic algorithm by connecting large-number Quantum multiplication with a quantum random number generator (QRNG). A code-based cryptographic approach using a Quantum Fourier Transformation (QFT) is taken with a giant asymmetric key in an explicit quantum circuit to establish a secure quantum communication system. In this research work, a 'plain text' (classical data) has been encrypted with QRNG using a Quantum multiplier with the aid of quantum arithmetic. Consequently, the resultant quantum data with QRNG data will be transmitted to the receiver end through the quantum channel, where the quantum divider decrypts the same. Furthermore, each intended component's IBM Qiskit simulation results and comparative analysis with previous works and algorithms suggest more robustness and reliability of the proposed quantum proof algorithm when considering large qubit quantum devices. The work provides a valuable direction for further developments in this domain and paves the way for future applications of quantum computing in post-quantum cryptography.