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

Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

Cryptanalysis of a Public Key Cryptosystem Based on Data Complexity Under Quantum Environment

Zhengjun Jing, Chunsheng Gu, Peizhong Shi

Published Jan 1, 2019• 0 citations
Publisher
DOI
10.1007/978-3-030-21373-2_32

Related papers

Cryptanalysis of a Public Key Cryptosystem Based on Data Complexity under Quantum Environment

Zhengjun Jing, Chunsheng Gu, Chunpeng Ge +1 more

Mobile Networks and Applications•Jan 27, 2020•3 citations

A public key cryptosystem based on data complexity under quantum environment

Wanqing Wu, Huanguo Zhang, Houzhen Wang +3 more

Science China Information Sciences•Sep 29, 2015•12 citations

Quantum Attacks on Public-Key Cryptosystems

Song Yuan Yan

Springer eBooks•Jan 1, 2013•62 citations

Lattice-based cryptography

Ayman W. Mohsen, Ayman Mohammad Bahaa-Eldin, Mohamed Sobh

Among the different cryptosystems, the Public Key Cryptosystems (PKCS) are of great usage and are used in many applications. Most of the current PKCS are based on a hard problem making the cryptanalysis of such cipher infeasible given the current computing and memory availability. However, Quantum Computing threatens all the current PKCS as they offer a new model that can solve those hard problems, e.g. the factorization problem of RSA or the discrete logarithm problem of ELGAMAL algorithm. Lattice Based PKCS are a promising filed to introduce an immune cipher system against quantum cryptanalysis. This paper presents a summary of recent progress in the field of lattice-based cryptography, by focusing on the recent advancement in lattice-based public key cryptosystems and key exchange mechanisms based on the learning with errors (LWE) problem and its ring variant Ring-LWE.

International Conference on Computer Engineering & Systems (ICCES)•Dec 1, 2017•22 citations

Quantum Cryptanalysis of Multivariate Permutation Problem

Guodong Sun, Shenghui Su, Maozhi Xu

Quantum computation is a new computational model based on quantum mechanical principle.Shor invented the polynomial time algorithms for the prime factorization and discrete logarithm problem, which indicated that the cryptosystems based on them are totally unsafe in the quantum world.Grover constructed an algorithm that finds a solution in only O( 2 n )steps whereas the exhaustive search algorithm needs O( 2n ) steps on average.In this paper we investigate the cryptanalysis of a new cryptography problem----multivariate permutation problem (MPP), which could be used to design public-key cryptosystem, with the help of the two quantum algorithms.Specially, we discuss the strength of a private key of the REESSE1+ public-key cryptosystem, whose security is based on the hardness of MPP.Besides, some suggestions are also given about the implementation of the REESSE1+.

International Journal of Security and Its Applications•Nov 30, 2014•1 citation

Mathematical Analysis of Public Key Encryption Algorithm and Security of Anti Quantum Cryptography

彪高泽 唐

Advances in Applied Mathematics•Jan 1, 2018•0 citations
Among the different cryptosystems, the Public Key Cryptosystems (PKCS) are of great usage and are used in many applications. Most of the current PKCS are based on a hard problem making the cryptanalysis of such cipher infeasible given the current computing and memory availability. However, Quantum Computing threatens all the current PKCS as they offer a new model that can solve those hard problems, e.g. the factorization problem of RSA or the discrete logarithm problem of ELGAMAL algorithm. Lattice Based PKCS are a promising filed to introduce an immune cipher system against quantum cryptanalysis. This paper presents a summary of recent progress in the field of lattice-based cryptography, by focusing on the recent advancement in lattice-based public key cryptosystems and key exchange mechanisms based on the learning with errors (LWE) problem and its ring variant Ring-LWE.
Quantum computation is a new computational model based on quantum mechanical principle.Shor invented the polynomial time algorithms for the prime factorization and discrete logarithm problem, which indicated that the cryptosystems based on them are totally unsafe in the quantum world.Grover constructed an algorithm that finds a solution in only O( 2 n )steps whereas the exhaustive search algorithm needs O( 2n ) steps on average.In this paper we investigate the cryptanalysis of a new cryptography problem----multivariate permutation problem (MPP), which could be used to design public-key cryptosystem, with the help of the two quantum algorithms.Specially, we discuss the strength of a private key of the REESSE1+ public-key cryptosystem, whose security is based on the hardness of MPP.Besides, some suggestions are also given about the implementation of the REESSE1+.