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

Information Security and Communications Privacy

How Public Key Cryptosystem Confronts the Challenge from Quantum Computing

Guan Hai-ming

Published Jan 1, 2007• 1 citation
OpenAlex

Abstract

This paper discusses the potential threat on public key cryptosystem by quantum computing, and the competition and development of public key cryptosystem featuring anti-quantum computing.

Related papers

The Need For Quantum - Resistant Cyber Security : A Review

K Subhashree, S, Kavitha, K, Sanjay

Conventional cyber security, especially public key cryptosystems depend upon the difficulty of solving large integer factorization and discrete log problems. The most straightforward way to solve these problems is to try all possible keys, which would be far too difficult for conventional computers. But the speed in which quantum computing is growing has posed a great threat to the conventional cryptosystems. This paper reviews how conventional public key cryptosystems might crumble under quantum computing and the need for quantum – safe cryptography.

International Journal of Scientific Research in Computer Science Engineering and Information Technology•Oct 12, 2019•0 citations

Security Notions for Quantum Public-Key Cryptography

Takeshi Koshiba

It is well known that Shor's quantum algorithm for integer factorization can break down the RSA public-key cryptosystem, which is widely used in many cryptographic applications. Thus, public-key cryptosystems in the quantum computational setting are longed for cryptology. In order to define the security notions of public-key cryptosystems, we have to model the power of the sender, receiver, adversary and channel. While we may consider a setting where quantum computers are available only to adversaries, we generally discuss what are the right security notions for (quantum) public-key cryptosystems in the quantum computational setting. Moreover, we consider the security of quantum public-key cryptosystems known so far.

arXiv:quant-ph/0702183•Feb 19, 2007•13 citations

The Challenge of Quantum Computing to Information Security and Our Countermeasures

Wang Hou-zheng

What cryptosystem to use is a severe challenge that we face in the quantum computing era.It is the only correct choice to research and establish an independent resistant quantum computing cryptosystem.This paper introduces to the research and development of resistant quantum computing cryptography,especially the signature scheme based on HASH function,lattice-based public key cryptosystem,MQ public key cryptosystem and public key cryptosystem based on error correcting codes.Also the paper gives some suggestions for further research on the quantum information theory,the complexity theory of quantum computing,design and analysis of resistant quantum computing cryptosystems.

Journal of Yunnan University of Nationalities•Jan 1, 2011•0 citations

Security Against Attacks to Cryptographic Algorithms by Quantum Computer – And Why Multiple Different Solutions Are Needed

Stefan Röhrich

This work describes and compares different ways to protect your systems against attacks by quantum computers. The comparison is done from a security and an implementation point of view.

NATO science for peace and security series. D, Information and communication security•Feb 19, 2024•0 citations

PROBLEMS OF QUANTUM CRYPTOGRAPHY IN A MODERN INFORMATION SOCIETY

Барашко Елена Николаевна, Alexey Alekseevich Fedorov

The article discusses and compares quantum and post-quantum cryptography and their relevance in the modern information society.

International Scientific Conference «Joint Innovation - Joint Development»•Sep 4, 2024•0 citations

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

Ritu Redhu, Ekta Narwal, Shivani Gupta +3 more

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.

Scientific Reports•May 1, 2024•5 citations
Conventional cyber security, especially public key cryptosystems depend upon the difficulty of solving large integer factorization and discrete log problems. The most straightforward way to solve these problems is to try all possible keys, which would be far too difficult for conventional computers. But the speed in which quantum computing is growing has posed a great threat to the conventional cryptosystems. This paper reviews how conventional public key cryptosystems might crumble under quantum computing and the need for quantum – safe cryptography.
It is well known that Shor's quantum algorithm for integer factorization can break down the RSA public-key cryptosystem, which is widely used in many cryptographic applications. Thus, public-key cryptosystems in the quantum computational setting are longed for cryptology. In order to define the security notions of public-key cryptosystems, we have to model the power of the sender, receiver, adversary and channel. While we may consider a setting where quantum computers are available only to adversaries, we generally discuss what are the right security notions for (quantum) public-key cryptosystems in the quantum computational setting. Moreover, we consider the security of quantum public-key cryptosystems known so far.
What cryptosystem to use is a severe challenge that we face in the quantum computing era.It is the only correct choice to research and establish an independent resistant quantum computing cryptosystem.This paper introduces to the research and development of resistant quantum computing cryptography,especially the signature scheme based on HASH function,lattice-based public key cryptosystem,MQ public key cryptosystem and public key cryptosystem based on error correcting codes.Also the paper gives some suggestions for further research on the quantum information theory,the complexity theory of quantum computing,design and analysis of resistant quantum computing cryptosystems.
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.