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

Springer eBooks

Quantum Resistant Cryptosystems

Song Yuan Yan

Published Jan 1, 2013• 3 citations
Publisher
DOI
10.1007/978-1-4419-7722-9_5

Related papers

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

Quantum Cryptosystem

Springer eBooks•Jan 1, 2010•0 citations

Quantum Public-Key Cryptosystem

Ming-Xing Luo, Xiu‐Bo Chen, Deng Yun +1 more

International Journal of Theoretical Physics•Sep 30, 2011•17 citations

The Modification of the Quantum-Resistant AJPS-1 Cryptographic Primitive

Dariya Yadukha

In recent years, quantum-resistant cryptography has been steadily developing, which is due, in particular, to the post-quantum cryptosystems competition of the National Institute of Standards and Technology (NIST), which has been ongoing since 2017. One of the participants in the first round of the competition is the AJPS cryptosystem. In this work, we propose the modification of the AJPS cryptosystem for bit-by-bit encryption by changing the numbers class used in the cryptosystem as a module. This modification increases the variability of the cryptosystem parameters.

Theoretical and Applied Cybersecurity•Feb 17, 2023•1 citation

Niederreiter cryptosystems using quasi-cyclic codes that resist quantum Fourier sampling

Upendra Kapshikar, Ayan Mahalanobis, IISER Pune, Pune, India

McEliece and Niederreiter cryptosystems are robust and versatile cryptosystems. These cryptosystems work with many linear error-correcting codes. They are popular these days because they can be quantum-secure. In this paper, we study the Niederreiter cryptosystem using non-binary quasi-cyclic codes. We prove, if these quasi-cyclic codes satisfy certain conditions, the corresponding Niederreiter cryptosystem is resistant to the hidden subgroup problem using weak quantum Fourier sampling. Though our work uses the weak Fourier sampling, we argue that its conclusions should remain valid for the strong Fourier sampling as well.

arXiv:1911.00661•Advances in Mathematics of Communications•Dec 17, 2021•1 citation

Quantum Public-Key Cryptosystems

圭介 田中, Keisuke Tanaka

•Jan 1, 2000•0 citations
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.
In recent years, quantum-resistant cryptography has been steadily developing, which is due, in particular, to the post-quantum cryptosystems competition of the National Institute of Standards and Technology (NIST), which has been ongoing since 2017. One of the participants in the first round of the competition is the AJPS cryptosystem. In this work, we propose the modification of the AJPS cryptosystem for bit-by-bit encryption by changing the numbers class used in the cryptosystem as a module. This modification increases the variability of the cryptosystem parameters.
McEliece and Niederreiter cryptosystems are robust and versatile cryptosystems. These cryptosystems work with many linear error-correcting codes. They are popular these days because they can be quantum-secure. In this paper, we study the Niederreiter cryptosystem using non-binary quasi-cyclic codes. We prove, if these quasi-cyclic codes satisfy certain conditions, the corresponding Niederreiter cryptosystem is resistant to the hidden subgroup problem using weak quantum Fourier sampling. Though our work uses the weak Fourier sampling, we argue that its conclusions should remain valid for the strong Fourier sampling as well.