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.
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.
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
The emergence of quantum computing presents significant challenges to existing Identity and Access Management (IAM) systems, particularly concerning the security of current cryptographic algorithms. As quantum computers evolve, traditional public-key cryptography methods like RSA and ECC face increasing vulnerability, necessitating a transition to quantum-resistant alternatives. This document explores the critical intersection of post-quantum cryptography and IAM, examining the transformation required in security frameworks to maintain resilience in a quantum-enabled future. The discussion encompasses the evolution of quantum threats to current IAM implementations, the development of post-quantum cryptographic solutions, the essential transformation of IAM infrastructure, and the integration of advanced technologies, including artificial intelligence and quantum-safe authentication mechanisms. Special attention is given to practical implementation considerations, including hybrid authentication models and the modernization of Public Key Infrastructure (PKI) systems to ensure continued security in the post-quantum era.
The impending arrival of viable quantum computing is a major worry to modern-day identity management systems that mainly depend on classical public-key cryptography techniques such as RSA and elliptic curve. Such systems are the basis of secure infrastructure in digital identities such as authentication, digital signature and trust models based on certificates. These cryptographic primitives can be broken using quantum algorithms like Shor and Grover, compromising the privacy of credentials and sessions stored and authenticated on digital ecosystems. The paper provides the necessity of the transition of identity management systems to post-quantum cryptographic (PQC) algorithms that will be resistant to quantum attacks. It gives a general overview of quantum-exposed identity protocols, as well as a look at the up-and-coming PQC algorithms under development, with a special call to digital signature algorithms capable of identity provision, authentication, and credential lifecycle management. Moreover, the paper isolates the problems of integration which include key size overhead, legacy system compatibility and performance trade-offs and suggests integration to take place through the use of hybrid and decentralized framework to allow a secure migration. This study will form part of a strategic plan to a post-quantum identity infrastructure, with the long term reliability, validity, and withstanding of quantum-era vulnerabilities.
Development of Quantum Computers are growing rapidly, the security of today’s cryptographic systems which are working with Public Key Infrastructure (PKI) is at serious risk. RSA and ECC algorithms are the backbone of secure communication and digital identity can be breakable by quantum algorithms such as Shor’s. Hence, a transition is required to Post-Quantum Cryptography (PQC), which is designed to handle quantum attacks. This work provides a detailed review of how PQC can be integrated with the existing PKI, with a special focus on the auto-enrollment process. Auto-enrollment is an essential process but often overlooked mechanism, responsible for automatically issuing and renewing digital certificates. First, we explored how current PKI systems are exposed to the quantum threats and the readiness. The performance of the algorithms that are standardized by NIST, such as Kyber and Dilithium were discussed. We analyze the technical and operational challenges of transitioning to PQC by referencing both research studies and real-world implementations from major industry players such as Google and Microsoft. These include large key size, certificate size, compatibility issues, complex computations and need for crypto-agility. We also examine the hybrid approaches that combine classical and post-quantum methods as traditional strategies. The survey concludes by outlining best practices, deployment considerations, and open research challenges that must be addressed for a smooth, secure, and scalable shift to quantum-safe PKI. This work aims to guide researchers, engineers, and policymakers in building the next generation of cryptographic infrastructure that can stand the test-time even in a quantum world.
Cryptography is an art of hiding the significant data or information with some other codes. It is a practice and study of securing information and communication. Thus, cryptography prevents third party intervention over the data communication. The cryptography technology transforms the data into some other form to enhance security and robustness against the attacks. The thrust of enhancing the security among data transfer has been emerged ever since the need of Artificial Intelligence field came into a market. Therefore, modern way of computing cryptographic algorithm came into practice such as AES, 3DES, RSA, Diffie-Hellman and ECC. These public-key encryption techniques now in use are based on challenging discrete logarithms for elliptic curves and complex factorization. However, those two difficult problems can be effectively solved with the help of sufficient large-scale quantum computer. The Post Quantum Cryptography (PQC) aims to deal with an attacker who has a large-scale quantum computer. Therefore, it is essential to build a robust and secure cryptography algorithm against most vulnerable pre-quantum cryptography methods. That is called ‘Post Quantum Cryptography’. Therefore, the present crypto system needs to propose encryption key and signature size is very large.in addition to careful prediction of encryption/decryption time and amount of traffic over the communication wire is required. The post-quantum cryptography (PQC) article discusses different families of post-quantum cryptosystems, analyses the current status of the National Institute of Standards and Technology (NIST) post-quantum cryptography standardisation process, and looks at the difficulties faced by the PQC community.
With the rapid advancement regarding quantum computing, traditional cryptographic systems face an existential threat because of their reliance concerning mathematical challenges which may be addressed effectively solved using quantum algorithms like the one developed by Shor. This imminent risk has driven extensive research into quantum-resistant cryptography (PQC), that seeks to develop encryption methods resilient against attacks powered by quantum computing. This study offers a thorough literature survey on high-level security techniques in quantum security for PQC, analysing past and current research efforts in this domain. We first examine the vulnerabilities of classical cryptographic protocols, including public-key encryption methods such as RSA (developed by Rivest, Shamir, and Adleman) and ECC (which uses elliptic curve mathematics), and traditional cryptographic hashing methods, against quantum adversaries. The study then explores the foundational approaches to quantum-secure cryptography, including lattice-based, hash-based, multivariate polynomial, code-based, and isogeny-based encryption methods that possess emerged as promising candidates for standardization. The survey highlights key challenges in the real-world application of PQC, including performance trade-offs, key size overhead, and deployment complexities. We conclude by identifying future research directions during the creation of scalable, efficient, and provably secure cryptographic methods designed to withstand quantum attacks techniques. As the shift toward the quantum-resilient era approaches, this survey aims to provide a clear and structured comprehension of the evolving the domain of quantum security for PQC.