ABSTRACT The rapid advancement of quantum computing poses a serious threat to classical authentication mechanisms that rely on computational hardness assumptions and software-based randomness. Traditional authentication systems such as passwords, one-time passwords (OTPs), and public-key cryptography depend heavily on pseudorandom number generators (PRNGs) and classical cryptographic algorithms, many of which are vulnerable to future quantum attacks. This paper proposes and analyzes a Hybrid Post-Quantum Secure Authentication system using Quantum-Generated One-Time Tokens (Q-OTT). The proposed approach combines true quantum randomness obtained from Quantum Random Number Generators (QRNGs) with post-quantum cryptographic (PQC) algorithms for token protection and verification. A detailed comparison between classical authentication systems and the hybrid Q-OTT approach is presented in terms of randomness, security, entropy, and quantum resistance. The study demonstrates that hybrid Q-OTT systems offer significantly enhanced security against both classical and quantum adversaries, at the cost of moderate infrastructure requirements. Keywords Post-Quantum Cryptography, Quantum Random Number Generator, One-Time Token, Authentication Systems, Quantum Security, Hybrid Authentication
ABSTRACT The rapid advancement of quantum computing poses a serious threat to classical authentication mechanisms that rely on computational hardness assumptions and software-based randomness. Traditional authentication systems such as passwords, one-time passwords (OTPs), and public-key cryptography depend heavily on pseudorandom number generators (PRNGs) and classical cryptographic algorithms, many of which are vulnerable to future quantum attacks. This paper proposes and analyzes a Hybrid Post-Quantum Secure Authentication system using Quantum-Generated One-Time Tokens (Q-OTT). The proposed approach combines true quantum randomness obtained from Quantum Random Number Generators (QRNGs) with post-quantum cryptographic (PQC) algorithms for token protection and verification. A detailed comparison between classical authentication systems and the hybrid Q-OTT approach is presented in terms of randomness, security, entropy, and quantum resistance. The study demonstrates that hybrid Q-OTT systems offer significantly enhanced security against both classical and quantum adversaries, at the cost of moderate infrastructure requirements. Keywords Post-Quantum Cryptography, Quantum Random Number Generator, One-Time Token, Authentication Systems, Quantum Security, Hybrid Authentication
Single points of failure are difficult for traditional identity authentication methods to manage since they primarily depend on a reliable central entity. Furthermore, it is challenging to develop and apply these traditional systems in remote scenarios since they require storing a significant amount of public key or identity authentication data. Existing identity identification systems face serious difficulties from the introduction of quantum computing, especially with regard to the security of current cryptographic techniques. The finest authentication method for preventing unwanted access in the past was the password. As the authentication system's technology advances daily, the password gets updated to become more secure. However, the industry and researchers have been forced to discover a new option where there is no chance of theft, hacking, or password cracking due to the fragility of this traditional approach. With the introduction of quantum key distribution techniques, secure authentication has reached a new level since, unlike post-quantum cryptography, PQC can offer absolute security. Identity authentication is so crucial, and over the past three decades, a number of systems utilizing quantum resources have been put forth for identity authentication. In this research, we provide identity authentication using QKD and the falcon scheme of PQC. Intrusion detection, security level, public key size, signing time, verification time, and key generation rate with 1, 128 + Quantum, 897, 200, 100, and 100 are some of the factors that are taken into consideration when evaluating the proposed identity authentication process. The importance of switching identity authentication systems to PQC methods they are not susceptible to quantum attacks is discussed in this study. It provides a summary of identity authentication algorithms that are quantum vulnerable. By utilizing post-quantum cryptography approaches, this research adds to the continuous work towards safe, effective, and user-friendly authentication solutions. A number of PQC algorithms are examined and contrasted.
The rapid advancements in quantum computing pose significant threats to traditional cryptographic systems, which are foundational to securing modern digital infrastructure. Cryptosystems like RSA and ECC, currently relied upon for secure communications, are vulnerable to quantum attacks, necessitating the development of post-quantum cryptography (PQC). The proposed methodology in this paper focuses on safeguarding critical infrastructure from quantum-based cyberattacks by leveraging PQC. The framework integrates several key strategies: hybrid cryptography, which combines classical and post-quantum algorithms to ensure security even as quantum threats evolve; quantum key distribution (QKD), ensuring secure communication by detecting any interception attempts; and post-quantum algorithms designed to resist quantum computing capabilities. The methodology also includes a robust security layer with incident response and threat monitoring systems to detect anomalies and initiate rapid responses to potential attacks. This holistic approach secures vital sectors like healthcare, energy, and telecommunications by future-proofing cryptographic measures against quantum threats.
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.
The emergence of quantum computing threatens to break widely deployed cryptographic primitives, compromising conventional authentication systems. Our work introduces a Hybrid Quantum Authentication Model (HQAM) that harnesses quantum technologies to enhance security without requiring quantum communication infrastructure. HQAM strategically integrates quantum entropy from Quantum Random Number Generators (QRNGs) across critical security components including digital fingerprints, dynamic nonces, and cryptographic keys while employing post-quantum cryptography as its primary configuration. The framework utilizes NIST-standardized algorithms (CRYSTALS-Kyber and CRYSTALS-Dilithium) for quantum-resistant assurance while maintaining RSA for legacy compatibility. Formal verification using ProVerif demonstrates HQAM’s resilience against impersonation and replay attacks, while additional mechanisms enable secure credential recovery. By combining certified quantum randomness with standardized post-quantum cryptography, HQAM provides a formally verified crypto-agile framework that ensures a robust authentication in both current and quantum-threatened environments.
The fundamental security of cryptographic protocols hinges on two intertwined pillars: secrecy and randomness. In classical cryptography, the relationship between these concepts is well-understood, often formalized through information theory and computational complexity. However, the advent of quantum computing poses a significant threat to many classical cryptographic primitives, necessitating a transition to post-quantum cryptography (PQC). This paper explores the critical notion of the secrecy-randomness equivalence within the context of post-quantum protocols. We delve into how the definitions and relationships between perfect secrecy, computational secrecy, true randomness, and pseudorandomness are impacted by quantum adversaries and quantum information theory. Specifically, we investigate whether the classical equivalence – where sufficient randomness can guarantee secrecy and robust secrecy often relies on high-quality randomness – holds or requires re-evaluation in a post-quantum landscape. We analyze the implications for the design and security proofs of various PQC families, including lattice-based, code-based, and hash-based schemes, considering the role of quantum random number generators (QRNGs) and the potential for quantum-enhanced attacks on randomness. Our findings suggest that while the core principles remain, the practical realization and theoretical guarantees of this equivalence become more nuanced, demanding careful consideration of quantum-resistant randomness sources and revised security models to ensure the long-term integrity of post-quantum cryptographic systems.
One of the solutions to the problem of secure communication is the Quantum Random Number Generators (QRNGs) which generate true randomness based on quantum mechanical principles.QRNGs are different from conventional pseudo random number generator in that they use quantum uncertainty to generate outputs which are very unpredictable.This work attempts to examine different QRNG architectures, study the possible integration of cryptographic frameworks with these architectures and highlight potential vulnerabilities in the integration of cryptographic frameworks with QRNG architectures.Post-processing techniques, i.e.Zero-Phase Component Analysis (ZPCA) and neural network based techniques are also studied to increase entropy and suppress environmental noise in QRNG systems.Key findings show that system jitter models based QRNG architectures are more scalable and less expensive for use in real world applications.Additionally, incorporating cryptographic protocols with the QRNGs endows them with the ability to resist quantum threats, and hence, provide better key distribution in the secure IoT communication frameworks.However, as security problems such as side channel attacks and hardware manipulation are still big issues.It also points out some of the emerging research trends including hybrid QRNG architectures, i.e., QRNG with classical PRNG to increase the entropy rate.As such, the proposed methodologies attempt to enhance QRNG scalability, security, and energy efficiency in cloud infrastructures, in mobile systems and in critical security environments.The advancement of these technologies will assume a crucial function in the advancement of quantum-safe frames for current advanced computerized foundation.