The concept of Post Quantum Cryptography (PQC) gains profound importance considering the imminent arrival of quantum computers.PQC involves security techniques that can withstand attacks from both regular and quantum computers.This urgency arises due to the anticipated progress in quantum computing, which poses significant risks to traditional cryptographic methods.As a result, there is a pressing need to swiftly establish PQC solutions to address these potential vulnerabilities.This research delves into various Post Quantum Cryptography (PQC) digital signature algorithms, examining their robustness against brute force attacks, network performance, and energy consumption.Also, the study focuses on MPPK/DS (Multivariate polynomial public key digital signature) algorithm in generating the Python code and further utilizing true random numbers from a quantum computer, secure MPPK/DS key pairs are generated, and their robustness is measured through semi-covariance correlation analysis, revealing MPPK's superior resilience compared to RSA and SPHINCS+.The study further assesses latency performance on 5G, Wi-Fi, and local networks, highlighting efficacy for real-world use.Additionally, the research addresses the energy consumption of all the major PQC NIST (National Institute of Standards and Technology) selected digital signature algorithms, stressing the significance of cryptographic solutions that can work well in conjunction with resourceconstrained upcoming intelligent networks of devices.As we move towards a quantumsafe cryptographic landscape, this work's contributions provide valuable insights for securing the digital realm in the face of emerging quantum threats.The research outcomes and developments are shared openly with the research community to facilitate further comparisons and advancements in the field of PQC algorithms.
The concept of Post Quantum Cryptography (PQC) gains profound importance considering the imminent arrival of quantum computers.PQC involves security techniques that can withstand attacks from both regular and quantum computers.This urgency arises due to the anticipated progress in quantum computing, which poses significant risks to traditional cryptographic methods.As a result, there is a pressing need to swiftly establish PQC solutions to address these potential vulnerabilities.This research delves into various Post Quantum Cryptography (PQC) digital signature algorithms, examining their robustness against brute force attacks, network performance, and energy consumption.Also, the study focuses on MPPK/DS (Multivariate polynomial public key digital signature) algorithm in generating the Python code and further utilizing true random numbers from a quantum computer, secure MPPK/DS key pairs are generated, and their robustness is measured through semi-covariance correlation analysis, revealing MPPK's superior resilience compared to RSA and SPHINCS+.The study further assesses latency performance on 5G, Wi-Fi, and local networks, highlighting efficacy for real-world use.Additionally, the research addresses the energy consumption of all the major PQC NIST (National Institute of Standards and Technology) selected digital signature algorithms, stressing the significance of cryptographic solutions that can work well in conjunction with resourceconstrained upcoming intelligent networks of devices.As we move towards a quantumsafe cryptographic landscape, this work's contributions provide valuable insights for securing the digital realm in the face of emerging quantum threats.The research outcomes and developments are shared openly with the research community to facilitate further comparisons and advancements in the field of PQC algorithms.
The advent of quantum computing poses a significant threat to current cryptographic systems, particularly public-key algorithms such as RSA and ECC, which are vulnerable to quantum attacks like Shor's algorithm. Post-Quantum Cryptography (PQC) aims to develop and standardize quantum-resistant cryptographic algorithms to secure digital communications in the quantum era. This paper examines the current landscape of PQC, focusing on the evaluation and standardization efforts led by organizations such as the National Institute of Standards and Technology (NIST). We analyze the major families of quantum-resistant algorithms, including lattice-based, hash-based, code-based, multivariate, and isogeny-based cryptography, discussing their security guarantees, performance trade-offs, and implementation challenges. Furthermore, we review NIST's PQC standardization process, highlighting selected finalists and alternate candidates, and explore the ongoing transition challenges in adopting these algorithms across industries. Finally, we discuss future directions for PQC research, including hybrid cryptographic systems and the need for continued cryptanalysis to ensure long-term security. This work provides a comprehensive overview of the progress and challenges in deploying quantum-resistant cryptography to safeguard against emerging quantum threats.
The emergence of quantum computing introduces unprecedented risks to classical cryptographic schemes, particularly digital signatures that safeguard authentication, confidentiality, and data integrity across digital ecosystems. To address these concerns, this paper investigates the adoption of Post-Quantum Cryptography (PQC) within Public Key Infrastructure (PKI) frameworks, emphasizing its role in strengthening electronic signature (eSign) systems against quantum threats. Traditional PKI implementations rely on algorithms such as RSA and ECC in combination with Hardware Security Modules (HSMs) for secure key management; however, these methods are vulnerable to quantum algorithms like Shor's. We examine how quantum-resistant alternatives-including lattice-based, hash-based, and multivariate polynomial-based schemes standardized by NIST-can be integrated into PKI without compromising interoperability and compliance. A comparative evaluation highlights trade-offs in performance, storage, and computational complexity while demonstrating the feasibility of embedding PQC into existing eSign infrastructures. Our findings underscore the urgency of transitioning towards quantum-safe digital signatures to ensure resilience, regulatory alignment, and long-term trust in national-scale digital services.
Information security is a fundamental and urgent issue in the digital transformation era. Cryptographic techniques and digital signatures have been applied to protect and authenticate relevant information. However, with the advent of quantum computers and quantum algorithms, classical cryptographic techniques have been in danger of collapsing because quantum computers can solve complex problems in polynomial time. Stemming from that risk, researchers worldwide have stepped up research on post-quantum algorithms to resist attack by quantum computers. In this review paper, we survey studies in recent years on post-quantum cryptography (PQC) and provide statistics on the number and content of publications, including a literature overview, detailed explanations of the most common methods so far, current implementation status, implementation comparisons, and discussion on future work. These studies focused on essential public cryptography techniques and digital signature schemes, and the US National Institute of Standards and Technology (NIST) launched a competition to select the best candidate for the expected standard. Recent studies have practically implemented the public key encryption/key encapsulation mechanism (PKE/KEM) and digital signature schemes on different hardware platforms and applied various optimization measures based on other criteria. Along with the increasing number of scientific publications, the recent trend of PQC research is increasingly evident and is the general trend in the cryptography industry. The movement opens up a promising avenue for researchers in public key cryptography and digital signatures, especially on algorithms selected by NIST.
The threats are existential to the traditional cryptosystems of public keys, including RSA, Diffie-Hellman, and elliptic curve cryptography (ECC), due to the rapid progress in quantum computing. Such algorithms as the Shor and Grover algorithms prove that as soon as large scale quantum computers are achieved, these classical cryptographic protocols will not provide any privacy and integrity to online communication. This has created an emergency to find post-quantum cryptography (PQC), or quantum-safe cryptography, which will resist attacks by both classical and quantum attackers. The paper is a review of the latest research and development in post-quantum cryptographic algorithms and their implementation in current security systems. We organize quantum-safe methods into significant organizations such as lattice-based, hash-based, multivariate polynomial-based and code-based encrypted communications. Each type has been evaluated critically based on computational efficiency, key sizes, speed of encryption/decryption and security proofs. The survey also examines the current standardization activities happening in the world and especially the U.S. National Institute of Standards and Technology (NIST) PQC competition, which lists candidate algorithms that have advanced to standard adoption. Besides this, the paper addresses hybrid cryptographic designs that use both classical and post-quantum bases in ensuring a seamless migration in the transition phase. Internet security protocols like TLS, VPNs and blockchain consensus as applications of PQC are examined in detail. Lastly, we pinpoint open research issues, which include creating lightweight PQC to support resource-constrained IoT devices, balancing performance and strong security assurances, and interoperability between the new PQC algorithms and existing infrastructures. Through detailed survey we inform the future of researchers, practitioners, and policymakers on the preparation of the post-quantum era of secure digital communications.
Post-Quantum Cryptography (PQC) is a rapidly developing field that addresses the potential threat quantum computers pose to the security of current cryptographic algorithms. With the rapid advancement of quantum computing technologies, it has become imperative to identify and standardize new cryptographic techniques that can withstand attacks from quantum computers. This paper explores the motivation behind PQC and provides an overview of the experimental research conducted in the field. It highlights the vulnerabilities of traditional cryptographic algorithms, such as RSA and ECC, to quantum attacks and emphasizes the need for transitioning to quantum-resistant alternatives. The experiments conducted in the PQC domain encompass the evaluation and analysis of candidate algorithms submitted to the NIST PQC competition. These experiments involve comprehensive security assessments, performance evaluations, and code audits to ensure the suitability and effectiveness of the proposed algorithms in real-world scenarios. This paper provides guidelines for organizations and practitioners adopting PQC. It discusses considerations for selecting and implementing post-quantum cryptographic algorithms, including security levels, algorithmic characteristics, performance tradeoffs, and integration challenges. It also outlines the importance of a smooth transition from classical to post-quantum cryptographic systems and highlights the need for standardization efforts to ensure interoperability and compatibility.
The advance of quantum computing poses significant risks to traditional cryptographic systems, including RSA and ECC, due to algorithms such as Shor's, prompting an urgent need for robust post-quantum cryptography (PQC) solutions. This paper presents a systematic review of PQC algorithms, encompassing lattice-based, code-based, multivariate polynomial, hash-based, and supersingular isogeny-based cryptography. By evaluating recent publications and NIST standardization efforts, we assess these approaches in terms of quantum resistance, computational efficiency, scalability, and implementation challenges. Lattice-based schemes, notably CRYSTALS-Kyber, excel in quantum-secure encryption and performance, whereas codebased systems like McEliece are hindered by large key sizes. Hash-based signatures, such as SPHINCS+, and isogeny-based protocols, including SIDH, provide promising alternatives but require further optimization to reduce computational overhead. Our analysis highlights the potential of hybrid PQC methods and lightweight hardware implementations for securing emerging domains like IoT, blockchain, and financial systems. The review serves as a foundational resource for researchers and practitioners, advocating the adoption of quantum-resistant cryptography to preserve data confidentiality, integrity, and authenticity in the quantum era.