The advent of quantum computing presents a significant threat to the security of asymmetric cryptographic algorithms, necessitating the adoption of new cryptographic mechanisms resilient to quantum-based attacks. This need is particularly critical for applications that rely exclusively on public-key cryptography, such as digital signatures. This paper presents a comprehensive analysis of the performance of various post-quantum cryptographic algorithms, focusing specifically on NIST-standardized digital signature algorithms—SPHINCS+ and Dilithium—and their practical implementations. The study evaluates these algorithms across different programming languages to identify optimal environments for diverse applications. Comparative analyses with the widely used RSA algorithm reveal that the computational cost of adopting post-quantum cryptographic systems is relatively low. Notably, some post-quantum algorithms demonstrate performance advantages over classical RSA in specific scenarios.
The advent of quantum computing presents a significant threat to the security of asymmetric cryptographic algorithms, necessitating the adoption of new cryptographic mechanisms resilient to quantum-based attacks. This need is particularly critical for applications that rely exclusively on public-key cryptography, such as digital signatures. This paper presents a comprehensive analysis of the performance of various post-quantum cryptographic algorithms, focusing specifically on NIST-standardized digital signature algorithms—SPHINCS+ and Dilithium—and their practical implementations. The study evaluates these algorithms across different programming languages to identify optimal environments for diverse applications. Comparative analyses with the widely used RSA algorithm reveal that the computational cost of adopting post-quantum cryptographic systems is relatively low. Notably, some post-quantum algorithms demonstrate performance advantages over classical RSA in specific scenarios.
The growing maturity of quantum computing is transforming theoretical cryptographic vulnerabilities into concrete security risks, threatening the foundations of modern public-key infrastructure. In response, the cryptographic community has developed a new generation of quantum-resistant algorithms, and NIST has finalized a portfolio of five Post-Quantum Cryptography (PQC) standards covering two fundamental primitives: key encapsulation and digital signatures. While the security properties of these algorithms are well understood, their practical performance on real hardware remains a critical open question for organizations planning the migration away from classical cryptography. This paper presents a performance evaluation of the five NIST-standardized PQC algorithms - CRYSTALS-Kyber, HQC, CRYSTALS-Dilithium, Falcon, and SPHINCS+ - on a general-purpose processor, across all supported security levels, and with RSA included as a classical baseline, providing practitioners with concrete and actionable data to guide algorithm selection in real deployment scenarios.
The National Institute of Standards and Technology (NIST) has recently concluded the third round of its Post Quantum Cryptography Standardization Process, selecting four finalist algorithms for standardization: CRYSTALS Kyber, CRYSTALS-Dilithium, FALCON, and SPHINCS+. These algorithms are designed to withstand attacks from both classical and quantum computers, ensuring the long-term security of digital communications. This paper presents a comprehensive comparative analysis of the security margins and practical deployment readiness of these finalist algorithms. CRYSTALS-Kyber, a key encapsulation mechanism based on the hardness of the Module Learning With Errors problem, offers strong security and efficient performance. CRYSTALS-Dilithium, a digital signature algorithm based on module lattices, provides robust security guarantees and relatively straightforward implementation. FALCON, a lattice-based digital signature algorithm utilizing the Fast Fourier Transform, offers compact signatures and fast verification but faces implementation challenges due to its reliance on floating-point arithmetic. SPHINCS+, a hash-based signature scheme, stands out as a conservative choice with security based solely on the well-established security of hash functions. The analysis reveals that while each algorithm has its strengths, they also face unique challenges in terms of side-channel vulnerabilities, formal security proofs, and performance trade-offs. The practical deployment of these algorithms requires careful consideration of specific security requirements, performance needs, and resource constraints. Ongoing research efforts aim to enhance the algorithms' resistance against advanced attacks, optimize their performance across diverse platforms, and develop standardized and secure hybrid cryptographic systems. The transition to post-quantum cryptography will involve challenges such as interoperability with legacy systems, the need for clear standards and regulatory guidance, and the costs associated with software and hardware updates. Continued engagement with the cryptographic community and monitoring of the evolving security landscape will be crucial for ensuring a secure and effective migration to post-quantum cryptography.
As quantum computing advances, modern cryptographic standards face an existential threat, necessitating a transition to post-quantum cryptography (PQC). The National Institute of Standards and Technology (NIST) has selected CRYSTALS-Kyber and CRYSTALS-Dilithium as standardized PQC algorithms for secure key exchange and digital signatures, respectively. This study conducts a comprehensive performance analysis of these algorithms by benchmarking execution times across cryptographic operations such as key generation, encapsulation, decapsulation, signing, and verification. Additionally, the impact of AVX2 optimizations is evaluated to assess hardware acceleration benefits. Our findings demonstrate that Kyber and Dilithium achieve efficient execution times, outperforming classical cryptographic schemes such as RSA and ECDSA at equivalent security levels. Beyond technical performance, the real-world deployment of PQC introduces challenges in telecommunications networks, where large-scale infrastructure upgrades, interoperability with legacy systems, and regulatory constraints must be addressed. This paper examines the feasibility of PQC adoption in telecom environments, highlighting key transition challenges, security risks, and implementation strategies. Through industry case studies, we illustrate how telecom operators are integrating PQC into 5G authentication, subscriber identity protection, and secure communications. Our analysis provides insights into the computational trade-offs, deployment considerations, and standardization efforts shaping the future of quantum-safe cryptographic infrastructure.
The rapid development of quantum computing poses a threat to traditional public-key systems. The existing Internet security framework relies heavily on public-key cryptography and hash functions, with classical algorithms such as RSA and ECC widely used for digital signatures and identity authentication. Meanwhile, quantum algorithms, represented by Shor’s algorithm and Grover’s algorithm, which can solve the integer factorization and discrete logarithm problems in polynomial time or significantly accelerate brute-force attacks on symmetric ciphers, posing a fundamental threat to traditional public-key cryptographic systems. To address the security threats posed by quantum computing, post-quantum cryptography has emerged. Transition schemes, such as the NIST post-quantum standards, have been proposed; however, new post-quantum algorithms require significantly more computational time for verification than traditional algorithms, and their migration into practical network protocols and blockchain systems presents considerable challenges. Among these, post-quantum digital signature technology is a key branch. This paper systematically reviews research progress in post-quantum digital signatures, summarizes NIST-standardized algorithms and cutting-edge non-standard schemes, and compares the performance of typical algorithms.
The advent of quantum computing presents a significant threat to classical public-key cryptographic systems, including RSA and Elliptic Curve Cryptography (ECC), thereby accelerating the development and standardization of post-quantum cryptography (PQC). This study evaluates the performance and implementation challenges of leading PQC algorithms across three major categories: lattice-based, hash-based, and multivariate cryptographic schemes. Utilizing empirical benchmark data from NIST candidate algorithms, the analysis focuses on key generation time, encryption latency, and memory consumption. Simulations and regression modeling reveal that lattice-based algorithms, particularly Kyber, demonstrate favorable trade-offs between computational efficiency and cryptographic strength. However, these schemes also present integration difficulties, especially in resource-constrained or legacy systems. Hash-based schemes like SPHINCS+ exhibit strong security guarantees but suffer from high latency and memory overhead, while multivariate algorithms such as Rainbow offer compact key sizes with moderate performance. The findings highlight the need for application-specific evaluation in selecting PQC solutions and provide actionable insights for guiding secure and efficient cryptographic transitions in the post-quantum era. Keywords: Post-Quantum Cryptography, Lattice-Based Cryptography, Hash-Based Cryptography, Multivariate Cryptography, Quantum Computing, Cryptographic Algorithms, Key Generation, Encryption Latency, Implementation Challenges, NIST PQC Standardization
The development of quantum computing technology is progressing very quickly, which poses a great threat to classical cryptographic algorithms like RSA and ECC, as they are based on mathematical problems that can be easily solved using quantum computing technology. To overcome the threat of quantum computing technology, the need for PQC algorithms like CRYSTALS Kyber, CRYSTALS Dilithium, Falcon, and SPHINCS+, which are standardized or recommended by NIST, has become essential in the era of cybersecurity. The feasibility of these algorithms in real time applications is the main focus of this thesis. A mixed approach is adopted for this purpose. Benchmark experiments were performed using the Open Quantum Safe library and PQC enabled OpenSSL for key generation, encryption, decryption, signature generation, signature verification, and TLS handshakes. Simulated environment and cloud environment were used for this purpose. Moreover, case studies were also conducted for cloud computing, financial sector, and IoT applications. Additionally, threat modeling is also performed for assessing the migration risks, i.e., “harvest now decrypt later.” The results indicate that the lattice-based methods, like Kyber and Dilithium, offer a robust trade off in terms of performance and security, albeit with increased key and signature sizes compared to classical methods. Hash based methods, like SPHINCS+, offer robust security, albeit with significant performance and size overheads, indicating that they are best used in specific circumstances. Hybrid approaches, using classical as well as quantum methods, were indicated as viable in the transition from classical to quantum methods, especially in circumstances that require backward compatibility. The paper concludes that NIST standardized PQC algorithms are technically viable for contemporary applications, especially in cloud computing and high-performance computing. However, for large-scale implementation, proper engineering and monitoring of developments in crypt analysis need to be performed. Future research should be directed towards implementation optimization, migration frameworks, and further studies in real-world implementations, especially for resource-constrained IoT and legacy system applications.