التفاصيل البيبلوغرافية
| العنوان: |
Cryptanalysis of a Public Key Cryptosystem Based on Data Complexity under Quantum Environment. |
| المؤلفون: |
Jing, Zhengjun, Gu, Chunsheng, Ge, Chunpeng, Shi, Peizhong |
| المصدر: |
Mobile Networks & Applications; Aug2021, Vol. 26 Issue 4, p1609-1615, 7p |
| مصطلحات موضوعية: |
PUBLIC key cryptography, ALGORITHMS, CRYPTOSYSTEMS, NP-complete problems, QUANTUM computers, CRYPTOGRAPHY, POLYNOMIAL time algorithms |
| مستخلص: |
Shor presented a quantum algorithm to factor large integers and compute discrete logarithms in polynomial time. As a result, public key cryptosystems, such as RSA, ElGamal and ECC, which are based on these computational assumptions will become insecure with the advent of quantum computers. To construct a secure anti-quantum public-key cryptosystem, Wu et al. introduced the notion of data complexity under quantum environment. Based on the hardness of NP-complete problems and data complexity, they presented a new public key cryptosystem and a signature scheme. Using Shor's quantum algorithm, we break their public key cryptosystem and signature scheme by directly solving the private key from the public key. Therefore, their public key cryptosystem and signature scheme are insecure in a quantum computer. [ABSTRACT FROM AUTHOR] |
|
Copyright of Mobile Networks & Applications is the property of Springer Nature and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| قاعدة البيانات: |
Complementary Index |
Full Text Finder