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

Scientific Reports

Software implementation of systematic polar encoding based PKC-SPE cryptosystem for quantum cybersecurity

Ritu Redhu, Ekta Narwal, Shivani Gupta, Reena Hooda, Sonika Ahlawat, Rupali Khurana

Published May 1, 2024• 5 citations
Publisher

Abstract

Abstract The ever-growing threats in cybersecurity growing with the rapid development of quantum computing, necessitates the development of robust and quantum-resistant cryptographic systems. This paper introduces a novel cryptosystem, Public Key Cryptosystem based on Systematic Polar Encoding (PKC-SPE), based on the combination of systematic polar encoding and public-key cryptographic principles. The Systematic Polar Encoding (SPE), derived from the well-established field of polar codes, serves as the foundation for this proposed cryptographic scheme. Here, we have used MATLAB Software to introduce and implement the PKC-SPE Cryptosystem. The paper examines key generation, encryption, and decryption algorithms, providing insights into the adaptability and efficiency of systematic polar encoding in public-key cryptography. We assess the efficiency of the PKC-SPE Cryptosystem in three aspects: key size, computational complexity, and system implementation timings. In addition, we compare the PKC-SPE Cryptosystem with PKC-PC cryptosystem and find that it has reduced key sizes ( $$P_{r}$$ Pr = 0.8436 kbytes). The results obtained through simulations validate the effectiveness of the proposed cryptosystem and highlighting its potential for integration into real-world communication systems. Thus, in the paradigm shift to quantum computing, the PKC-SPE cryptosystem emerges as a promising candidate to secure digital communication in the quantum computing era.

DOI
10.1038/s41598-024-60767-3

Related papers

Enhancing the Security of Public Key Cryptography in Addressing Quantum Computing Threats

Oluwole Oguntoyinbo, Abel Yeboah-Ofori, Chukwuebuka Francis Ikenga-Metuh +3 more

The potential of quantum computing to compromise traditional public-key cryptography (PKC) has led to a pressing need for more efficient and resilient cryptographic methods. Recent advancements, such as the 800x improvement in the logical error rate by Microsoft and QUANTINUUM, underscore the urgency of this issue. Post-quantum cryptography (PQC) offers a promising solution designed to withstand quantum attacks. This paper examines how PQC and other advanced cryptographic techniques can enhance the security and efficiency of PKC in the quantum era. Current PKC methods, despite revolutionizing secure online communication, are vulnerable to flaws in their underlying algorithms. The proposed hybrid model integrates PQC with traditional PKC, leveraging both technologies' strengths to mitigate quantum threats while preserving established security benefits. The investigation addresses critical research questions: how to enhance PKC key management for better efficiency and security, and which PQC techniques can protect PKC from quantum attacks. This paper's contribution includes identifying vulnerabilities in existing PKC, comparing RSA and post-quantum algorithms, and implementing a PQC algorithm between a client and server to analyze integration with existing protocols. Finally, the paper recommends security mechanisms to improve PQC protocols, ensuring robust protection against emerging quantum computing capabilities.

International Conference on Electrical and Computer Engineering Researches (ICECER)•Dec 4, 2024•0 citations

Simple PKE schemes from the TSPEM problem

Limin Zhou, Qiuyang Wang

In the quantum era, the advent of quantum computers poses significant threats to the security of current cryptosystems. Therefore, designing quantum-resistant cryptoschemes becomes important to guarantee information security. This work concentrates on the development of the post-quantum public key encryption (PKE) scheme. Non-commutative cryptography (NCC) has entered the field of post-quantum cryptography. We utilize the TSPEM problem with asymmetric structures (which serve as a potential candiate for resisting quantum attacks) to construct two PKE schemes which are demonstrated to be CPA security under the DTSPEM assumption. By representing the plaintext as a matrix, these schemes can effectively encrypt a significant amount of information in a single operation. Assuming an equal amount of messages for encryption, the proposed schemes acheive superior efficiency compared to existing PKE schemes. Structurally, our systems exhibit a level of synchronization and coexistence due to the distinct public keys $ (P) $ and ciphertexts $ (C_{1}) $. The efficiency analysis is conducted by comparing known schemes from the aspect of specific cryptographic indicators. Generally, the proposed ones offer several advantages including provable security, high efficiency, potential quantum-resistant, and relative ease of implementation; along with synchronization and coexistence. Our investigation has established the feasibility of constructing PKE schemes based on the TSPEM problem, specifically for asymmetric communication scenarios. The preliminary results pave the way for further exploration of the TSPEM problem$ ' $s potential in developing other cryptosystems suitable for quantum computing environments.

AIMS Mathematics•Jan 1, 2024•0 citations

A Survey of Cryptographic Algorithms in Cybersecurity: From Classical Methods to Quantum-Resistant Solutions

Swapnali N Tambe-Jagtap

As quantum computing technology evolves, it poses greater risks to current cryptography schemes such as RSA and Elliptic Curve Cryptography (ECC), widely used to secure digital communications These classical algorithms are based on mathematical problems that quantum algorithms such as Shore-Grover deal with. Both, can resolve much faster, making them vulnerable to quantum attack This has given rise to post-quantum cryptography (PQC), which focuses on developing quantum-resistant algorithms to protect data in the future of quantum computers classical cryptography Can Break This paper aims to provide a comprehensive insight into quantum-resistant cryptographic algorithms, including lattice-based, hash-based, code-based, and multivariable polynomial methods. It examines the efficiency, benefits, and challenges associated with implementing these algorithms in real-world applications. By comparing key parameters such as key size, encryption/decryption speed, and signature size, this study examines the relative strengths and limitations of post-quantum algorithms to their classical counterparts The results show that lattice-based algorithms , such as NTRU and Kyber, offer promising solutions with relative efficiency and manageable key sizes, making them potential candidates for quantum-resistant cryptography but other approaches , such as SPHINCS+ (hash-based) and McEliece (code-based), large -Face challenges of key size and slow encryption speed, which may limit their usefulness in some applications Despite these challenges, quantum post-cryptography is necessary to secure the future of digital communications.

Shifra.•Jun 1, 2023•29 citations

Post-Quantum Cryptography: A Snapshot of Standardization Efforts

Kübra Seyhan, Sedat Akleylek

The production of quantum computers with fast processing power and practical use will adversely affect the foundations of secure communication, especially for public-key cryptosystems (PKCs). Potential problems and solution scenarios are created early to design quantum-resistant PKCs. In this paper, the emergence of the concept of post-quantum cryptography (PQC) and early precautionary actions are explained. In addition, cryptosystem families that are known/believed to be secure in the presence of quantum computers are discussed. Based on these classes, the selected encryption/key encapsulation (KEM) and signature schemes of the NIST PQC process are expressed. Finally, some open problems for the post-quantum era are summarized.

NATO science for peace and security series. D, Information and communication security•Nov 9, 2022•4 citations

Performance Evaluation for a Post-Quantum Public-Key Cryptosystem

Thomas Prantl, Dominik Prantl, Lukas Beierlieb +4 more

Quantum Computing threatens security of today’s systems. Confidence in today’s security technologies largely relies on Public Key Cryptography (PKC), which depends on computational difficulty of mathematical problems that cannot be solved efficiently using any technology available today. This will, however, change once a sufficiently capable quantum computer will become available. Similarly, security of symmetric crypto algorithms will also be substantially weakened. Current progress in research proves that Quantum Computing is no longer science fiction. Hence, research and development of post-quantum cryptographic algorithms that can withstand attacks in Quantum Computing era are of paramount importance. This paper complements existing research in this domain with a performance analysis of a post-quantum cryptosystem capable of encrypting and decrypting messages either bit-wise or string-wise. Specifically, we describe a workflow for implementing the scheme, design a reproducible hardware performance evaluation testbed for an IoT and an online shopping scenario, define performance metrics, and perform performance evaluation case studies. Our performance analysis shows that bit-wise encryption and decryption and the corresponding key generation fits resource-constrained IoT microcontrollers as well as on average laptops. The encryption and decryption of a bit each take less than 30 ms and the key generation less than 300 ms.

IEEE International Performance, Computing, and Communications Conference•Oct 29, 2021•10 citations

Quantum Key Distribution Based on Systematic Polar Coding

Georgi Bebrov

Here we concerned with quantum key distribution - a way to establish common cryptographic key between several parties. The work proposes a combination between quantum key distribution and systematic polar coding (an error correction algorithm) frameworks - quantum key distribution based on systematic polar coding. This results in obtaining key rates greater than standard quantum key distribution (BB84) and its efficient version (eBB84) when finite-size regime and lower-error-rate quantum channel are considered.

quant-pharXiv:2511.18818•Quantum Information Processing•Nov 25, 2025•0 citations
Abstract The ever-growing threats in cybersecurity growing with the rapid development of quantum computing, necessitates the development of robust and quantum-resistant cryptographic systems. This paper introduces a novel cryptosystem, Public Key Cryptosystem based on Systematic Polar Encoding (PKC-SPE), based on the combination of systematic polar encoding and public-key cryptographic principles. The Systematic Polar Encoding (SPE), derived from the well-established field of polar codes, serves as the foundation for this proposed cryptographic scheme. Here, we have used MATLAB Software to introduce and implement the PKC-SPE Cryptosystem. The paper examines key generation, encryption, and decryption algorithms, providing insights into the adaptability and efficiency of systematic polar encoding in public-key cryptography. We assess the efficiency of the PKC-SPE Cryptosystem in three aspects: key size, computational complexity, and system implementation timings. In addition, we compare the PKC-SPE Cryptosystem with PKC-PC cryptosystem and find that it has reduced key sizes ( PrP_{r}Pr​ Pr = 0.8436 kbytes). The results obtained through simulations validate the effectiveness of the proposed cryptosystem and highlighting its potential for integration into real-world communication systems. Thus, in the paradigm shift to quantum computing, the PKC-SPE cryptosystem emerges as a promising candidate to secure digital communication in the quantum computing era.
The potential of quantum computing to compromise traditional public-key cryptography (PKC) has led to a pressing need for more efficient and resilient cryptographic methods. Recent advancements, such as the 800x improvement in the logical error rate by Microsoft and QUANTINUUM, underscore the urgency of this issue. Post-quantum cryptography (PQC) offers a promising solution designed to withstand quantum attacks. This paper examines how PQC and other advanced cryptographic techniques can enhance the security and efficiency of PKC in the quantum era. Current PKC methods, despite revolutionizing secure online communication, are vulnerable to flaws in their underlying algorithms. The proposed hybrid model integrates PQC with traditional PKC, leveraging both technologies' strengths to mitigate quantum threats while preserving established security benefits. The investigation addresses critical research questions: how to enhance PKC key management for better efficiency and security, and which PQC techniques can protect PKC from quantum attacks. This paper's contribution includes identifying vulnerabilities in existing PKC, comparing RSA and post-quantum algorithms, and implementing a PQC algorithm between a client and server to analyze integration with existing protocols. Finally, the paper recommends security mechanisms to improve PQC protocols, ensuring robust protection against emerging quantum computing capabilities.
In the quantum era, the advent of quantum computers poses significant threats to the security of current cryptosystems. Therefore, designing quantum-resistant cryptoschemes becomes important to guarantee information security. This work concentrates on the development of the post-quantum public key encryption (PKE) scheme. Non-commutative cryptography (NCC) has entered the field of post-quantum cryptography. We utilize the TSPEM problem with asymmetric structures (which serve as a potential candiate for resisting quantum attacks) to construct two PKE schemes which are demonstrated to be CPA security under the DTSPEM assumption. By representing the plaintext as a matrix, these schemes can effectively encrypt a significant amount of information in a single operation. Assuming an equal amount of messages for encryption, the proposed schemes acheive superior efficiency compared to existing PKE schemes. Structurally, our systems exhibit a level of synchronization and coexistence due to the distinct public keys $ (P) $ and ciphertexts $ (C_{1}) .Theefficiencyanalysisisconductedbycomparingknownschemesfromtheaspectofspecificcryptographicindicators.Generally,theproposedonesofferseveraladvantagesincludingprovablesecurity,highefficiency,potentialquantum−resistant,andrelativeeaseofimplementation;alongwithsynchronizationandcoexistence.OurinvestigationhasestablishedthefeasibilityofconstructingPKEschemesbasedontheTSPEMproblem,specificallyforasymmetriccommunicationscenarios.ThepreliminaryresultspavethewayforfurtherexplorationoftheTSPEMproblem. The efficiency analysis is conducted by comparing known schemes from the aspect of specific cryptographic indicators. Generally, the proposed ones offer several advantages including provable security, high efficiency, potential quantum-resistant, and relative ease of implementation; along with synchronization and coexistence. Our investigation has established the feasibility of constructing PKE schemes based on the TSPEM problem, specifically for asymmetric communication scenarios. The preliminary results pave the way for further exploration of the TSPEM problem.Theefficiencyanalysisisconductedbycomparingknownschemesfromtheaspectofspecificcryptographicindicators.Generally,theproposedonesofferseveraladvantagesincludingprovablesecurity,highefficiency,potentialquantum−resistant,andrelativeeaseofimplementation;alongwithsynchronizationandcoexistence.OurinvestigationhasestablishedthefeasibilityofconstructingPKEschemesbasedontheTSPEMproblem,specificallyforasymmetriccommunicationscenarios.ThepreliminaryresultspavethewayforfurtherexplorationoftheTSPEMproblem ' $s potential in developing other cryptosystems suitable for quantum computing environments.
As quantum computing technology evolves, it poses greater risks to current cryptography schemes such as RSA and Elliptic Curve Cryptography (ECC), widely used to secure digital communications These classical algorithms are based on mathematical problems that quantum algorithms such as Shore-Grover deal with. Both, can resolve much faster, making them vulnerable to quantum attack This has given rise to post-quantum cryptography (PQC), which focuses on developing quantum-resistant algorithms to protect data in the future of quantum computers classical cryptography Can Break This paper aims to provide a comprehensive insight into quantum-resistant cryptographic algorithms, including lattice-based, hash-based, code-based, and multivariable polynomial methods. It examines the efficiency, benefits, and challenges associated with implementing these algorithms in real-world applications. By comparing key parameters such as key size, encryption/decryption speed, and signature size, this study examines the relative strengths and limitations of post-quantum algorithms to their classical counterparts The results show that lattice-based algorithms , such as NTRU and Kyber, offer promising solutions with relative efficiency and manageable key sizes, making them potential candidates for quantum-resistant cryptography but other approaches , such as SPHINCS+ (hash-based) and McEliece (code-based), large -Face challenges of key size and slow encryption speed, which may limit their usefulness in some applications Despite these challenges, quantum post-cryptography is necessary to secure the future of digital communications.
The production of quantum computers with fast processing power and practical use will adversely affect the foundations of secure communication, especially for public-key cryptosystems (PKCs). Potential problems and solution scenarios are created early to design quantum-resistant PKCs. In this paper, the emergence of the concept of post-quantum cryptography (PQC) and early precautionary actions are explained. In addition, cryptosystem families that are known/believed to be secure in the presence of quantum computers are discussed. Based on these classes, the selected encryption/key encapsulation (KEM) and signature schemes of the NIST PQC process are expressed. Finally, some open problems for the post-quantum era are summarized.
Quantum Computing threatens security of today’s systems. Confidence in today’s security technologies largely relies on Public Key Cryptography (PKC), which depends on computational difficulty of mathematical problems that cannot be solved efficiently using any technology available today. This will, however, change once a sufficiently capable quantum computer will become available. Similarly, security of symmetric crypto algorithms will also be substantially weakened. Current progress in research proves that Quantum Computing is no longer science fiction. Hence, research and development of post-quantum cryptographic algorithms that can withstand attacks in Quantum Computing era are of paramount importance. This paper complements existing research in this domain with a performance analysis of a post-quantum cryptosystem capable of encrypting and decrypting messages either bit-wise or string-wise. Specifically, we describe a workflow for implementing the scheme, design a reproducible hardware performance evaluation testbed for an IoT and an online shopping scenario, define performance metrics, and perform performance evaluation case studies. Our performance analysis shows that bit-wise encryption and decryption and the corresponding key generation fits resource-constrained IoT microcontrollers as well as on average laptops. The encryption and decryption of a bit each take less than 30 ms and the key generation less than 300 ms.
Here we concerned with quantum key distribution - a way to establish common cryptographic key between several parties. The work proposes a combination between quantum key distribution and systematic polar coding (an error correction algorithm) frameworks - quantum key distribution based on systematic polar coding. This results in obtaining key rates greater than standard quantum key distribution (BB84) and its efficient version (eBB84) when finite-size regime and lower-error-rate quantum channel are considered.