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

IEEE High Performance Extreme Computing Conference

Post Quantum Cryptography(PQC) - An overview: (Invited Paper)

Manoj Kumar, Pratap Pattnaik

Published Sep 22, 2020• 80 citations
Publisher

Abstract

We discuss the Post Quantum Cryptography algorithms for key establishment under consideration by NIST for standardization. Three of these, Crystals- Kyber, Classic McEliece and Supersingular Isogeny based Key Encapsulation (SIKE), are representatives of the three classes of hard problems underlying the security of almost all 69 candidate algorithms accepted by NIST for consideration in round 1 of evaluation. For each algorithm, we briefly describe the hard problem underlying the algorithm's cryptographic strength, the algebraic structure i.e., the groups or finite fields, underlying the computations, the basic computations performed in these algorithms, the algorithm itself, and the performance considerations for efficient implementation of the basic algorithm on conventional many-core processors. For Crystals- Kyber and SIKE, we will discuss the potential solutions to improve their performance on many-core processors.

DOI
10.1109/hpec43674.2020.9286147

Related papers

Post-Quantum Cryptography: A Review of Algorithms, Challenges, and Future Research Directions

Parth Sane, Samrat Pravin Patel

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 code-based 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.

International Conference on Signal Processing and Information Security (ICSPIS)•Nov 18, 2025•1 citation

Post Quantum Cryptography (PQC): Securing Data In The Age Of Quantum Computers

P. Ganga Bhavani, P. Nandini Lakshmi, V. Jahnavi +2 more

The emergence of quantum computing is a serious threat to the principles of modern crypto-logical mathematics. The classical public-key cryptography, including Rivest-Shamir-Adleman (RSA), Elliptic Curve Cryptography (ECC), and Diffie-Hellman are very safe against classical adversaries yet become susceptible to quantum algorithms, including the Shor algorithm, which can easily solve the underlying mathematical problems. This weakness is jeopardizing confidentiality and integrity of the world-wide systems of communication, money transactions, and essential structures, and requires the immediate creation of safe alternatives. The current literature on post-quantum cryptography (PQC) has covered various classes of algorithm, such as lattice-based, code-based, multivariate schemes, and isogeny-based schemes. Although lattice-based approaches like Nth Degree Truncated Polynomial Ring Unit (NTRU) and FrodoKEM can be highly theoretically resistant, they can be computationally and memory-intensive. Cryptosystems based on code such as Classic McEliece are secure but not practicable because they have huge public key sizes. Multivariate schemes like Rainbow, and isogeny-based schemes like Super singular Isogeny Key Encapsulation (SIKE) have been attacked recently by cryptanalytic attacks, and broken completely. Such restrictions open the necessity to find more efficient and secure quantum-resistant solutions.This research study postulates a hybrid post-quantum cryptographic (PQC) system that combines CRYSTALS-Kyber for encryption with CRYSTALS-Dilithium for digital signatures both of which are approved through the National Institute of Standards and Technology (NIST) PQC standardization program. The model will be such that it ensures quantum resistance but at the same time it will be scalable, efficient and compatible with the existing infrastructures. The test outcomes indicate that the hybrid PQC model is 35-45 percent faster to encrypt and decrypt, signature performance is enhanced by up to 40 percent, and the throughput is 20 times higher (98.7 Mbps) than the same base PQC scheme including Nth Degree Truncated Polynomial Ring Unit (NTRU), McEliece and Rainbow. These enhancements affirm that the suggested model provides a viable trade-off between the security, speed, and efficiency in terms of key size, which makes it a viable and a sound base to ensure secure communication in the quantum age.

International Journal of Science Engineering and Technology•May 26, 2026•0 citations

Post-Quantum Cryptography: Algorithms and Implementation Challenges

Murali Krishna Pasupuleti

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

International Journal of Academic and Industrial Research Innovations(IJAIRI)•Jun 26, 2025•2 citations

An Academic Review of the SIKE Attack in Post-Quantum Cryptography Failure

Krishanu Naskar, Abhishek Dey

Supersingular Isogeny Key Encapsulation (SIKE) was a promising candidate in the National Institute of Standards and Technology (NIST) Post-Quantum Cryptography (PQC) standardization process, as it is distinguished by its exceptionally small key sizes, which makes it attractive for resource-constrained environments, and an elegant mathematical foundation rooted in supersingular elliptic curve isogenies. Its security based on the presumed hardness of computing isogenies between such curves. However, in August 2022, a groundbreaking attack by Castryck and Decru completely compromised SIKE, demonstrating its insecurity with practical polynomial-time complexity. This pivotal event led to SIKE`s immediate withdrawal from NIST`s standardization efforts, reshaping the evolving landscape of post-quantum cryptography and underscoring essential lessons in cryptographic design, evaluation, and diversity. A comprehensive academic analysis of the SIKE cryptographic scheme methodology and details of the specific nature of the Castryck-Decru attack that rendered it insecure is provided by this paper. It also discusses in brief the far-reaching implications for cryptographic design, standardization processes, and the pursuit of quantum-resistant algorithms, giving particular emphasis on the current state of post-quantum cryptography or PQC standardization as of 2025.

International Journal of Computer Sciences and Engineering•Aug 31, 2025•0 citations

Performance Analysis and Comparison of Post-Quantum Cryptography Algorithms

Cristiano G. M., Salvatore D’Antonio, Jonah Giglio +1 more

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.

IEEE International Conference on Cyber Security and Resilience (CSR)•Aug 1, 2026•0 citations

Post-Quantum Cryptography Algorithms for Future-Proof Security

Helena Lindberg, Hugo Klein

The 2024 NIST finalisation of post-quantum cryptography (PQC) standards -- CRYSTALS-Kyber (FIPS 203), CRYSTALS-Dilithium (FIPS 204), FALCON (FIPS 205), and SPHINCS+ -- marks the transition from research to deployment-ready quantum-resistant cryptography. This paper proposes the Post-Quantum Cryptography Algorithm Evaluation (PQCAE) framework, a systematic performance and security analysis of five NIST-standardised and candidate PQC algorithms across five deployment dimensions: key/signature size, computational performance, security level, implementation complexity, and hardware acceleration potential. PQCAE evaluates CRYSTALS-Kyber-768, CRYSTALS-Dilithium-3, FALCON-512, SPHINCS+-128s, and BIKE-L1 on three hardware platforms (x86-64 server, ARM Cortex-M4 embedded, and FPGA). CRYSTALS-Kyber achieves the best overall profile for key encapsulation -- fastest operations (KeyGen 0.06 ms, Encaps 0.08 ms, Decaps 0.09 ms on x86-64) with compact keys. FALCON-512 provides the smallest signature sizes (897 bytes) at moderate computational cost. SPHINCS+ offers the strongest conservative security (hash-based, no lattice assumptions) but largest signatures (8 KB). PQCAE provides migration guidance for organisations transitioning from classical to post-quantum cryptography.

Quantum Frontiers Journal•Jun 28, 2025•0 citations
We discuss the Post Quantum Cryptography algorithms for key establishment under consideration by NIST for standardization. Three of these, Crystals- Kyber, Classic McEliece and Supersingular Isogeny based Key Encapsulation (SIKE), are representatives of the three classes of hard problems underlying the security of almost all 69 candidate algorithms accepted by NIST for consideration in round 1 of evaluation. For each algorithm, we briefly describe the hard problem underlying the algorithm's cryptographic strength, the algebraic structure i.e., the groups or finite fields, underlying the computations, the basic computations performed in these algorithms, the algorithm itself, and the performance considerations for efficient implementation of the basic algorithm on conventional many-core processors. For Crystals- Kyber and SIKE, we will discuss the potential solutions to improve their performance on many-core processors.
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 code-based 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.
The emergence of quantum computing is a serious threat to the principles of modern crypto-logical mathematics. The classical public-key cryptography, including Rivest-Shamir-Adleman (RSA), Elliptic Curve Cryptography (ECC), and Diffie-Hellman are very safe against classical adversaries yet become susceptible to quantum algorithms, including the Shor algorithm, which can easily solve the underlying mathematical problems. This weakness is jeopardizing confidentiality and integrity of the world-wide systems of communication, money transactions, and essential structures, and requires the immediate creation of safe alternatives. The current literature on post-quantum cryptography (PQC) has covered various classes of algorithm, such as lattice-based, code-based, multivariate schemes, and isogeny-based schemes. Although lattice-based approaches like Nth Degree Truncated Polynomial Ring Unit (NTRU) and FrodoKEM can be highly theoretically resistant, they can be computationally and memory-intensive. Cryptosystems based on code such as Classic McEliece are secure but not practicable because they have huge public key sizes. Multivariate schemes like Rainbow, and isogeny-based schemes like Super singular Isogeny Key Encapsulation (SIKE) have been attacked recently by cryptanalytic attacks, and broken completely. Such restrictions open the necessity to find more efficient and secure quantum-resistant solutions.This research study postulates a hybrid post-quantum cryptographic (PQC) system that combines CRYSTALS-Kyber for encryption with CRYSTALS-Dilithium for digital signatures both of which are approved through the National Institute of Standards and Technology (NIST) PQC standardization program. The model will be such that it ensures quantum resistance but at the same time it will be scalable, efficient and compatible with the existing infrastructures. The test outcomes indicate that the hybrid PQC model is 35-45 percent faster to encrypt and decrypt, signature performance is enhanced by up to 40 percent, and the throughput is 20 times higher (98.7 Mbps) than the same base PQC scheme including Nth Degree Truncated Polynomial Ring Unit (NTRU), McEliece and Rainbow. These enhancements affirm that the suggested model provides a viable trade-off between the security, speed, and efficiency in terms of key size, which makes it a viable and a sound base to ensure secure communication in the quantum age.
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
Supersingular Isogeny Key Encapsulation (SIKE) was a promising candidate in the National Institute of Standards and Technology (NIST) Post-Quantum Cryptography (PQC) standardization process, as it is distinguished by its exceptionally small key sizes, which makes it attractive for resource-constrained environments, and an elegant mathematical foundation rooted in supersingular elliptic curve isogenies. Its security based on the presumed hardness of computing isogenies between such curves. However, in August 2022, a groundbreaking attack by Castryck and Decru completely compromised SIKE, demonstrating its insecurity with practical polynomial-time complexity. This pivotal event led to SIKE`s immediate withdrawal from NIST`s standardization efforts, reshaping the evolving landscape of post-quantum cryptography and underscoring essential lessons in cryptographic design, evaluation, and diversity. A comprehensive academic analysis of the SIKE cryptographic scheme methodology and details of the specific nature of the Castryck-Decru attack that rendered it insecure is provided by this paper. It also discusses in brief the far-reaching implications for cryptographic design, standardization processes, and the pursuit of quantum-resistant algorithms, giving particular emphasis on the current state of post-quantum cryptography or PQC standardization as of 2025.
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 2024 NIST finalisation of post-quantum cryptography (PQC) standards -- CRYSTALS-Kyber (FIPS 203), CRYSTALS-Dilithium (FIPS 204), FALCON (FIPS 205), and SPHINCS+ -- marks the transition from research to deployment-ready quantum-resistant cryptography. This paper proposes the Post-Quantum Cryptography Algorithm Evaluation (PQCAE) framework, a systematic performance and security analysis of five NIST-standardised and candidate PQC algorithms across five deployment dimensions: key/signature size, computational performance, security level, implementation complexity, and hardware acceleration potential. PQCAE evaluates CRYSTALS-Kyber-768, CRYSTALS-Dilithium-3, FALCON-512, SPHINCS+-128s, and BIKE-L1 on three hardware platforms (x86-64 server, ARM Cortex-M4 embedded, and FPGA). CRYSTALS-Kyber achieves the best overall profile for key encapsulation -- fastest operations (KeyGen 0.06 ms, Encaps 0.08 ms, Decaps 0.09 ms on x86-64) with compact keys. FALCON-512 provides the smallest signature sizes (897 bytes) at moderate computational cost. SPHINCS+ offers the strongest conservative security (hash-based, no lattice assumptions) but largest signatures (8 KB). PQCAE provides migration guidance for organisations transitioning from classical to post-quantum cryptography.