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

Communications in computer and information science

Ameliorated Standardization Framework for Post-Quantum Cryptographic Algorithms

Sripada Soumya, T. Chithralekha, Asmita Adhikary

Published Jan 1, 2025• 0 citations
Publisher
DOI
10.1007/978-3-031-83790-6_1

Related papers

An Ameliorated Evaluation Framework for Standardizing Quantum Encryption Algorithms

Sripada Soumya, T. Chithralekha

Lecture notes in networks and systems•Dec 27, 2025•0 citations

Enhancing crypto-interoperability resilience (CIR) by bridging the gap between classical and post-quantum cryptographic standards

Tarun Kumar Jain, Loveleen Kumar, Ginika Mahajan +2 more

With the emergence of real quantum computing technology, the quest to establish strong and secure post-quantum cryptographic (PQC) standards will only grow more urgent. These security standards protect data and communications against the groundbreaking capabilities of quantum computers that threaten to break many of today’s ubiquitous cryptographic systems. But there’s a major practical gap in PQC standards so they can work with current cryptographic infrastructure. In this paper we present the notion of Crypto-Interoperability Resilience (CIR), which is defined as that a cryptographic system possesses the ability to use post-quantum algorithms behind classical protected protocols in an interchangeable way and can transition from a classical secure mode to a quantum secure mode transparently while remaining secure. Integrating post-quantum (PQ) cryptographic algorithms into existing systems are difficult and comes with compatibility issues, performance limitations, and security concern from the insecure period while migrating, which this research addresses. We present holistic frameworks and methodologies for employing PQC standards in practice. These frameworks allow for stepwise adoption with no disruption of existing functionality and offers backward compatibility. We also create tools and protocols for improving CIR which efforts are performance-optimized and are designed to preserve security at a very high level as well.

Journal of Discrete Mathematical Sciences and Cryptography•Jan 1, 2025•0 citations

Standardisation of and Migration to Post-Quantum Cryptography

Liqun Chen

Lecture notes in computer science•Jan 1, 2025•5 citations

Post-Quantum Cryptography Algorithms

Safa Mohamed , Safa Mostafa , Safa Kamal

•Jul 25, 2026•0 citations

On Migration to Quantum-Safe Cryptography

Jan Oupický

In 1994, Peter Shor developed a quantum algorithm that can efficiently solve the factorization and discrete logarithm problems. These problems are the foundation of modern cryptographic algorithms and the existence of an efficient algorithm for solving them threatens their security. Although large-scale quantum computers capable of breaking current cryptographic algorithms are not yet available, advances in quantum technology and the risk of “store now, decrypt later” attacks make it essential to prepare for migration to quantum-safe cryptography today. For the past decade, the cryptographic community has been actively developing algorithms that are not exploitable by Shor’s algorithm; such algorithms are said to be “quantum-safe” or “post-quantum.” However, cryptographic algorithms do not exist in isolation—they are components of larger cryptographic systems, such as protocols or other cryptographic primitives. Migrating these systems to use quantum-safe algorithms is therefore a complex task. This thesis studies the migration of several widely used cryptographic systems to post-quantum cryptography. In particular, we consider the migration of the public-key infrastructure (PKI), the TLS protocol, the XML Encryption and XML Signature standards, the SAML security framework, the Advanced Electronic Signature (AdES) standard, and the password-authenticated public-key encryption (PAPKE) primitive. For each topic, we analyze how the presence of quantum adversaries affects the security of existing constructions and identify components that rely on cryptographic assumptions vulnerable to quantum attacks. Based on this analysis, we propose approaches for adapting these systems to use post-quantum cryptographic algorithms. The proposed solutions are considered in two main forms: purely post-quantum and hybrid post-quantum. Purely post-quantum approaches rely exclusively on post-quantum algorithms, while hybrid post-quantum approaches combine classical and post-quantum mechanisms in order to provide security as long as at least one of the underlying assumptions remains secure. Hybrid post-quantum approaches are primarily motivated by uncertainty regarding the security of post-quantum algorithms. For each proposal, we discuss the advantages and disadvantages of the design, including deployment complexity, compatibility with existing systems, and performance considerations. In several cases, we also provide proof-of-concept implementations and evaluate their performance through benchmarks. We study post-quantum public-key infrastructures, which form a fundamental component of many other cryptographic systems. We show that constructing a purely post-quantum PKI does not fundamentally differ from constructing a classical PKI. For hybrid deployments, we propose two approaches—the composite hybrid and the parallel hybrid—which differ primarily in their implementation complexity. We also survey and analyze existing proposals for post-quantum TLS. In contrast, systems such as XML encryption and XML signatures, the SAML security framework, and the eIDAS-related AdES standard have received little attention in the context of post-quantum migration. For these systems, we outline possible migration approaches and provide proof-of-concept implementations. In addition, we present an example migration plan for a Trust Service Provider that relies on all of the discussed cryptographic systems, together with the methodology used to develop it. Finally, we consider the migration of the cryptographic primitive PAPKE. We propose a novel construction that replaces an ideal cipher with a half-ideal cipher, resulting in more efficient quantum-safe constructions and motivating the study of a new public-key encryption property called decryption robustness.

•Jun 26, 2026•0 citations

Analysis of Post Quantum Cryptography Algorithms concerning their applicability to IoT devices

Anjum Ashraaf

The increasing ubiquity of Internet of Things (IoT) devices has necessitated robust security measures, especially with the impending threat of quantum computing to conventional cryptographic protocols.In this study, we address the imperative of selecting an optimized post-quantum cryptographic algorithm tailored for implementation on resource-constrained IoT devices while ensuring compliance with stringent security standards.This research employs a comprehensive evaluation framework that considers the unique constraints of IoT devices, including limited computational capabilities and memory resources.Furthermore, our assessment accounts for the diverse security requirements stipulated by prevailing standards to guarantee resilience against both classical and quantum threats.Through a systematic analysis of various post-quantum cryptographic algorithms, encompassing factors such as computational efficiency and resistance to quantum attacks, this study identifies a select set of algorithms that exhibit promising suitability for IoT device deployment.The evaluation considers renowned standards, including NIST's Post-Quantum Cryptography Standardization initiative to align with industry best practices and interoperability.The findings presented in this study offer guidance to IoT device manufacturers, system architects, and security practitioners in making informed decisions regarding the adoption of post-quantum cryptographic algorithms.The selected algorithms not only demonstrate adeptness in mitigating quantum threats but also address resource constraints inherent in IoT environments, ensuring a secure foundation for the rapidly expanding ecosystem of interconnected devices.

•Jan 12, 2024•3 citations
With the emergence of real quantum computing technology, the quest to establish strong and secure post-quantum cryptographic (PQC) standards will only grow more urgent. These security standards protect data and communications against the groundbreaking capabilities of quantum computers that threaten to break many of today’s ubiquitous cryptographic systems. But there’s a major practical gap in PQC standards so they can work with current cryptographic infrastructure. In this paper we present the notion of Crypto-Interoperability Resilience (CIR), which is defined as that a cryptographic system possesses the ability to use post-quantum algorithms behind classical protected protocols in an interchangeable way and can transition from a classical secure mode to a quantum secure mode transparently while remaining secure. Integrating post-quantum (PQ) cryptographic algorithms into existing systems are difficult and comes with compatibility issues, performance limitations, and security concern from the insecure period while migrating, which this research addresses. We present holistic frameworks and methodologies for employing PQC standards in practice. These frameworks allow for stepwise adoption with no disruption of existing functionality and offers backward compatibility. We also create tools and protocols for improving CIR which efforts are performance-optimized and are designed to preserve security at a very high level as well.
In 1994, Peter Shor developed a quantum algorithm that can efficiently solve the factorization and discrete logarithm problems. These problems are the foundation of modern cryptographic algorithms and the existence of an efficient algorithm for solving them threatens their security. Although large-scale quantum computers capable of breaking current cryptographic algorithms are not yet available, advances in quantum technology and the risk of “store now, decrypt later” attacks make it essential to prepare for migration to quantum-safe cryptography today. For the past decade, the cryptographic community has been actively developing algorithms that are not exploitable by Shor’s algorithm; such algorithms are said to be “quantum-safe” or “post-quantum.” However, cryptographic algorithms do not exist in isolation—they are components of larger cryptographic systems, such as protocols or other cryptographic primitives. Migrating these systems to use quantum-safe algorithms is therefore a complex task. This thesis studies the migration of several widely used cryptographic systems to post-quantum cryptography. In particular, we consider the migration of the public-key infrastructure (PKI), the TLS protocol, the XML Encryption and XML Signature standards, the SAML security framework, the Advanced Electronic Signature (AdES) standard, and the password-authenticated public-key encryption (PAPKE) primitive. For each topic, we analyze how the presence of quantum adversaries affects the security of existing constructions and identify components that rely on cryptographic assumptions vulnerable to quantum attacks. Based on this analysis, we propose approaches for adapting these systems to use post-quantum cryptographic algorithms. The proposed solutions are considered in two main forms: purely post-quantum and hybrid post-quantum. Purely post-quantum approaches rely exclusively on post-quantum algorithms, while hybrid post-quantum approaches combine classical and post-quantum mechanisms in order to provide security as long as at least one of the underlying assumptions remains secure. Hybrid post-quantum approaches are primarily motivated by uncertainty regarding the security of post-quantum algorithms. For each proposal, we discuss the advantages and disadvantages of the design, including deployment complexity, compatibility with existing systems, and performance considerations. In several cases, we also provide proof-of-concept implementations and evaluate their performance through benchmarks. We study post-quantum public-key infrastructures, which form a fundamental component of many other cryptographic systems. We show that constructing a purely post-quantum PKI does not fundamentally differ from constructing a classical PKI. For hybrid deployments, we propose two approaches—the composite hybrid and the parallel hybrid—which differ primarily in their implementation complexity. We also survey and analyze existing proposals for post-quantum TLS. In contrast, systems such as XML encryption and XML signatures, the SAML security framework, and the eIDAS-related AdES standard have received little attention in the context of post-quantum migration. For these systems, we outline possible migration approaches and provide proof-of-concept implementations. In addition, we present an example migration plan for a Trust Service Provider that relies on all of the discussed cryptographic systems, together with the methodology used to develop it. Finally, we consider the migration of the cryptographic primitive PAPKE. We propose a novel construction that replaces an ideal cipher with a half-ideal cipher, resulting in more efficient quantum-safe constructions and motivating the study of a new public-key encryption property called decryption robustness.
The increasing ubiquity of Internet of Things (IoT) devices has necessitated robust security measures, especially with the impending threat of quantum computing to conventional cryptographic protocols.In this study, we address the imperative of selecting an optimized post-quantum cryptographic algorithm tailored for implementation on resource-constrained IoT devices while ensuring compliance with stringent security standards.This research employs a comprehensive evaluation framework that considers the unique constraints of IoT devices, including limited computational capabilities and memory resources.Furthermore, our assessment accounts for the diverse security requirements stipulated by prevailing standards to guarantee resilience against both classical and quantum threats.Through a systematic analysis of various post-quantum cryptographic algorithms, encompassing factors such as computational efficiency and resistance to quantum attacks, this study identifies a select set of algorithms that exhibit promising suitability for IoT device deployment.The evaluation considers renowned standards, including NIST's Post-Quantum Cryptography Standardization initiative to align with industry best practices and interoperability.The findings presented in this study offer guidance to IoT device manufacturers, system architects, and security practitioners in making informed decisions regarding the adoption of post-quantum cryptographic algorithms.The selected algorithms not only demonstrate adeptness in mitigating quantum threats but also address resource constraints inherent in IoT environments, ensuring a secure foundation for the rapidly expanding ecosystem of interconnected devices.