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

Global Conference on Communications and Information Technologies (GCCIT)

Quantum Randomness and Key Hashing in SSH Authentication Across Asymmetric Cryptographic Algorithms

M. A., S Sudikshan, Navin Balaji E, Adarsh A, M. Gayathri

Published Oct 25, 2024• 0 citations
Publisher

Abstract

In the ever-evolving field of cybersecurity, randomness plays a critical role in cryptographic systems. Traditional pseudo-random number generators, while widely used, can be vulnerable to attacks due to their deterministic nature. This paper explores the integration of quantum randomness into SSH authentication by utilizing a Quantum Random Number Generator (QRNG) to enhance key generation across various asymmetric cryptographic algorithms, specifically RSA, ECDSA, and EdDSA. Quantum-generated randomness offers a higher level of unpredictability, strengthening the security of cryptographic keys. We propose a method to generate keys using quantum random bits, hash them using SHA-256, and secure them for SSH authentication. The generated keys are evaluated for security improvements over conventional methods, and the performance of SSH authentication is analyzed. The results demonstrate that incorporating quantum randomness into key generation increases the cryptographic strength of the keys, offering a more robust defense against potential cryptanalytic attacks, while maintaining compatibility with existing SSH protocols. This approach signifies a step forward in leveraging quantum technologies to enhance network communication security.

DOI
10.1109/gccit63234.2024.10862579

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

The Role of Quantum Random Number Generators in Cybersecurity

Mmaduekwe Ebuka Paul, Ugochukwu Mmaduekwe, Tolu-iloriIyanuoluwa Tolu-iloriIyanuoluwa

The success of cybersecurity security depends on cryptographic protocols because they shield sensitive information as well as communication channels and serve to authenticate procedures. These protocols derive their foundation from producing robust random numbers because these numbers serve as the basis for encryption key creation and digital signature generation along with secure access protocols. Random number generators used traditionally such as PRNGs and HRNGs suffer from determinism, and predictability flaws combined with the risk of outside tampering thus affecting their reliability. The weaknesses in cryptographic security become dangerous because of the rising quantum computer threats that would break current encryption methods. Quantum Random Number Generators (QRNGs) introduce revolutionary changes through the quantum mechanics properties of quantum superposition and photon polarization and vacuum fluctuations for truly random number generation. The use of QRNGs brings high-security benefits by giving algorithms unpredictable outputs that hackers cannot predict nor alter without being detected. Implementing QRNGs in cybersecurity networks enables better encryption algorithms as well as securely protected communication systems with strong resistance against contemporary cyber attacks. This article outlines the advantages of QRNGs over traditional RNGs, applications in cryptographic systems, and how they can protect against threats from emerging quantum computing technologies. It also covers the challenges in implementing QRNGs, including hardware complexity, cost, and integration into existing security infrastructures. As cyber threats continue to evolve, QRNGs represent an important milestone in ensuring robust and future-proof cryptographic security

International Journal of Advances in Engineering and Management•Feb 1, 2025•0 citations

Algorithmic Cryptography – Dynamic Key Generation via Quantum-Enhanced Random Number Generation

Jincheng Zhang

This paper introduces an algorithmic cryptographic system predicated on dynamic key generation utilizing quantum-enhanced random number generation. Traditional cryptographic methods rely on deterministic processes and computational complexity, making them susceptible to various attacks. We propose a novel approach that leverages quantum superposition and entanglement to produce keys with substantially higher entropy and resistance to known attacks. The core mechanism centers around establishing a 'seed' – a fundamentally unpredictable state – within a quantum system that serves as the foundation for generating truly random keys. The system's design incorporates advanced quantum algorithms to enhance the randomness and security of key creation. This research explores the potential of quantum-enhanced randomness to revolutionize key generation, offering a significant advancement over existing methods.

•Sep 6, 2026•0 citations

Quantum Randomness in Cryptography—A Survey of Cryptosystems, RNG-Based Ciphers, and QRNGs

Anish Saini, Athanasios Tsokanos, Raimund Kirner

Cryptography is the study and practice of secure communication with digital data and focuses on confidentiality, integrity, and authentication. Random number generators (RNGs) generate random numbers to enhance security. Even though the cryptographic algorithms are public and their strength depends on the keys, cryptoanalysis of encrypted ciphers can significantly contribute to the unveiling of the cipher’s key. Therefore, to ensure high data security over a network, researchers need to improve the randomness of keys as they develop cryptosystems. Quantum particles have a leading edge in advancing RNG technology as they can provide true randomness, unlike pseudo-random numbers generators (PRNGs). In order to increase the level of the security of cryptographic systems based on random numbers, this survey focuses on three objectives: Cryptosystems with related cryptographic attacks, RNG-based cryptosystems, and the design of quantum random number generators (QRNGs). This survey aims to provide researchers with information about the importance of RNG-based ciphers and various research techniques for QRNGs that can incorporate quantum-based true randomness in cryptosystems.

Information•Jul 27, 2022•30 citations

Quantum-Inspired Cryptographic Key Generation Based on Random Walk Dynamics

Jincheng Zhang

This paper proposes a novel approach to cryptographic key generation utilizing quantum-inspired random walk dynamics. Traditional key generation methods often rely on deterministic algorithms susceptible to attacks. We introduce an algorithm where key generation is driven by a random walk process, mimicking the probabilistic nature of quantum mechanics. The core of our method lies in the manipulation of the movement probabilities within the random walk, incorporating concepts like superposition and interference to create a significantly more unpredictable and robust key generation process. The resulting keys are generated through a series of iterations where the walker's position is determined by a probability distribution influenced by multiple potential pathways. We demonstrate that this approach can produce keys with enhanced security properties compared to conventional methods, offering a potential defense against attacks targeting predictable key generation processes. The algorithm's success is evaluated through simulations demonstrating its resistance to various attack vectors. The key mathematical formulation and algorithmic steps are presented in detail, outlining the core principles and operational mechanics of the proposed system. Furthermore, we explore the theoretical underpinnings of the method, linking it to concepts in quantum probability and random walk theory.

•Aug 28, 2026•0 citations

Quantum Randomness-Driven Authentication: A Novel Framework for Ultra-Secure Identity Verification

Sheng Chen, Zhiyuan Ye, Zhenya Wang +2 more

In the face of escalating threats against conventional cryptographic authentication systems, quantum random number generators (QRNGs) offer a promising path toward unforgeable and unpredictable security primitives. This paper presents a quantum randomness-driven identity authentication framework that leverages device-independent QRNGs to generate ephemeral, irreproducible identity tokens. Unlike classical pseudo-random methods, QRNG-based schemes produce entropy from fundamental quantum phenomena, ensuring resistance to reverse engineering and side-channel attacks. The proposed protocol integrates quantum tokens into a mutual challenge–response structure, employs lightweight post-processing via entropy extractors, and supports deployment in low-latency IoT and edge computing scenarios. Experimental evaluations using QRNG-augmented authentication on simulated identity datasets demonstrate marked improvements in authentication unpredictability, collision resistance, and robustness under adversarial impersonation attempts. This work provides an end-to-end blueprint for embedding quantum entropy into next-generation identity frameworks, bridging the gap between quantum hardware and practical cybersecurity applications.

International Conference on Cyber Security and Information Engineering (ICCSIE)•Jul 23, 2025•0 citations
In the ever-evolving field of cybersecurity, randomness plays a critical role in cryptographic systems. Traditional pseudo-random number generators, while widely used, can be vulnerable to attacks due to their deterministic nature. This paper explores the integration of quantum randomness into SSH authentication by utilizing a Quantum Random Number Generator (QRNG) to enhance key generation across various asymmetric cryptographic algorithms, specifically RSA, ECDSA, and EdDSA. Quantum-generated randomness offers a higher level of unpredictability, strengthening the security of cryptographic keys. We propose a method to generate keys using quantum random bits, hash them using SHA-256, and secure them for SSH authentication. The generated keys are evaluated for security improvements over conventional methods, and the performance of SSH authentication is analyzed. The results demonstrate that incorporating quantum randomness into key generation increases the cryptographic strength of the keys, offering a more robust defense against potential cryptanalytic attacks, while maintaining compatibility with existing SSH protocols. This approach signifies a step forward in leveraging quantum technologies to enhance network communication security.
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 success of cybersecurity security depends on cryptographic protocols because they shield sensitive information as well as communication channels and serve to authenticate procedures. These protocols derive their foundation from producing robust random numbers because these numbers serve as the basis for encryption key creation and digital signature generation along with secure access protocols. Random number generators used traditionally such as PRNGs and HRNGs suffer from determinism, and predictability flaws combined with the risk of outside tampering thus affecting their reliability. The weaknesses in cryptographic security become dangerous because of the rising quantum computer threats that would break current encryption methods. Quantum Random Number Generators (QRNGs) introduce revolutionary changes through the quantum mechanics properties of quantum superposition and photon polarization and vacuum fluctuations for truly random number generation. The use of QRNGs brings high-security benefits by giving algorithms unpredictable outputs that hackers cannot predict nor alter without being detected. Implementing QRNGs in cybersecurity networks enables better encryption algorithms as well as securely protected communication systems with strong resistance against contemporary cyber attacks. This article outlines the advantages of QRNGs over traditional RNGs, applications in cryptographic systems, and how they can protect against threats from emerging quantum computing technologies. It also covers the challenges in implementing QRNGs, including hardware complexity, cost, and integration into existing security infrastructures. As cyber threats continue to evolve, QRNGs represent an important milestone in ensuring robust and future-proof cryptographic security
This paper introduces an algorithmic cryptographic system predicated on dynamic key generation utilizing quantum-enhanced random number generation. Traditional cryptographic methods rely on deterministic processes and computational complexity, making them susceptible to various attacks. We propose a novel approach that leverages quantum superposition and entanglement to produce keys with substantially higher entropy and resistance to known attacks. The core mechanism centers around establishing a 'seed' – a fundamentally unpredictable state – within a quantum system that serves as the foundation for generating truly random keys. The system's design incorporates advanced quantum algorithms to enhance the randomness and security of key creation. This research explores the potential of quantum-enhanced randomness to revolutionize key generation, offering a significant advancement over existing methods.
Cryptography is the study and practice of secure communication with digital data and focuses on confidentiality, integrity, and authentication. Random number generators (RNGs) generate random numbers to enhance security. Even though the cryptographic algorithms are public and their strength depends on the keys, cryptoanalysis of encrypted ciphers can significantly contribute to the unveiling of the cipher’s key. Therefore, to ensure high data security over a network, researchers need to improve the randomness of keys as they develop cryptosystems. Quantum particles have a leading edge in advancing RNG technology as they can provide true randomness, unlike pseudo-random numbers generators (PRNGs). In order to increase the level of the security of cryptographic systems based on random numbers, this survey focuses on three objectives: Cryptosystems with related cryptographic attacks, RNG-based cryptosystems, and the design of quantum random number generators (QRNGs). This survey aims to provide researchers with information about the importance of RNG-based ciphers and various research techniques for QRNGs that can incorporate quantum-based true randomness in cryptosystems.
This paper proposes a novel approach to cryptographic key generation utilizing quantum-inspired random walk dynamics. Traditional key generation methods often rely on deterministic algorithms susceptible to attacks. We introduce an algorithm where key generation is driven by a random walk process, mimicking the probabilistic nature of quantum mechanics. The core of our method lies in the manipulation of the movement probabilities within the random walk, incorporating concepts like superposition and interference to create a significantly more unpredictable and robust key generation process. The resulting keys are generated through a series of iterations where the walker's position is determined by a probability distribution influenced by multiple potential pathways. We demonstrate that this approach can produce keys with enhanced security properties compared to conventional methods, offering a potential defense against attacks targeting predictable key generation processes. The algorithm's success is evaluated through simulations demonstrating its resistance to various attack vectors. The key mathematical formulation and algorithmic steps are presented in detail, outlining the core principles and operational mechanics of the proposed system. Furthermore, we explore the theoretical underpinnings of the method, linking it to concepts in quantum probability and random walk theory.
In the face of escalating threats against conventional cryptographic authentication systems, quantum random number generators (QRNGs) offer a promising path toward unforgeable and unpredictable security primitives. This paper presents a quantum randomness-driven identity authentication framework that leverages device-independent QRNGs to generate ephemeral, irreproducible identity tokens. Unlike classical pseudo-random methods, QRNG-based schemes produce entropy from fundamental quantum phenomena, ensuring resistance to reverse engineering and side-channel attacks. The proposed protocol integrates quantum tokens into a mutual challenge–response structure, employs lightweight post-processing via entropy extractors, and supports deployment in low-latency IoT and edge computing scenarios. Experimental evaluations using QRNG-augmented authentication on simulated identity datasets demonstrate marked improvements in authentication unpredictability, collision resistance, and robustness under adversarial impersonation attempts. This work provides an end-to-end blueprint for embedding quantum entropy into next-generation identity frameworks, bridging the gap between quantum hardware and practical cybersecurity applications.