A new quantum algorithm for computing RSA ciphertext period

详细信息    查看全文

• 作者：Yahui Wang ; Songyuan Yan ; Huanguo Zhang
• 关键词：information security ; cryptology ; RSA cryptography ; quantum computing
• 刊名：Wuhan University Journal of Natural Sciences
• 出版年：2017
• 出版时间：February 2017
• 年：2017
• 卷：22
• 期：1
• 页码：68-72
• 全文大小：
• 刊物类别：Mathematics and Statistics
• 刊物主题：Life Sciences, general; Materials Science, general; Computer Science, general;
• 出版者：Wuhan University
• ISSN：1993-4998
• 卷排序：22

文摘

Shor proposed a quantum polynomial-time integer factorization algorithm to break the RSA public-key cryptosystem. In this paper, we propose a new quantum algorithm for breaking RSA by computing the order of the RSA ciphertext C. The new algorithm has the following properties: 1) recovering the RSA plaintext M from the ciphertext C without factoring n; 2) avoiding the even order of the element; 3) having higher success probability than Shor’s; 4) having the same complexity as Shor’s.