Leveraging the power of quantum computing for breaking RSA encryption

被引:4
作者
Sharma M. [1 ]
Choudhary V. [2 ]
Bhatia R.S. [3 ]
Malik S. [1 ]
Raina A. [1 ]
Khandelwal H. [1 ]
机构
[1] Department of Computer Science and Engineering, MAIT, Delhi
[2] Department of Computer Science Engineering, JIMS, Greater Noida
[3] Department of Electrical Engineering, NIT, Kurukshetra
关键词
computer Security; CSP (Constraint Satisfaction Problem); factorisation; probability; public key cryptography; Quantum computer; qubit; RSA cryptosystem; shor’s algorithm; superposition;
D O I
10.1080/23335777.2020.1811384
中图分类号
学科分类号
摘要
Encryption is the process of securing confidential data that bars a third party’s access to the information.RSA encryption utilises the property of complexity classes wherein the problem of prime integer factorization lies inside the Non-Polynomial time (NP-Hard) class, which makes it impervious to classical computers. Since it is so hard to break even for a computer, it becomes important to do encryption for all the secure transactions. Although it lies outside the capabilities of traditional computing, the recent developments in the field of quantum computing can be utilised to break RSA Encryption. The approach involves mapping of qubits used in a quantum machine to a constraint satisfaction problem (CSP) and then using them to check for factors. This consists of the use of a Multiplicative Boolean circuit in which the qubits utilised by the machine replaces the variables. These Qubits are then mapped as per the gates involved, and the factorization problem is thus transformed into a CSP problem, through which, the factors can be easily found. Once known, these factors can be used to calculate the public and private keys effectively breaking the encryption security. We provide a novel approach to highlight the importance of developing Post-Quantum cryptography techniques for providing a secure channel of communication. © 2020 Informa UK Limited, trading as Taylor & Francis Group.
引用
收藏
页码:73 / 92
页数:19
相关论文
共 23 条
[1]  
Zhao Y., Quantum cryptography in real-life applications: assumptions and security, dissertation Ph.D, (2009)
[2]  
Vaudenay S., Secure communications over insecure channels based on short authenticated strings, Advances in cryptology–CRYPTO 2005. CRYPTO 2005. lecture notes in computer science, 3621, (2005)
[3]  
Gupta I., Narain L., Veni Madhavan C.E., Cryptological applications of permutation polynomials, Electron Notes Dis Mathemat, 15, (2003)
[4]  
Gabidulin E.M., Ourivski A.V., Honary B., Et al., Reducible rank codes and their applications to cryptography, IEEE Trans Inf Theory, 49, 12, pp. 3289-3293, (2003)
[5]  
Qadir A.M., Varol N., A review paper on cryptography, 2019 7th International Symposium on Digital Forensics and Security (ISDFS), pp. 1-6, (2019)
[6]  
Sharbaf M.S., Quantum cryptography: an emerging technology in network security, 2011 IEEE International Conference on Technologies for Homeland Security (HST), pp. 13-19, (2011)
[7]  
Cruz B., Domingo K., Guzman F., Et al., Expanded 128-bit data encryption standard, (2017)
[8]  
Rivest R.L., Shamir A., Adleman L., A method for obtaining digital signatures and public-key cryptosystems, Commun ACM, 21, 2, pp. 120-126, (1978)
[9]  
Nielsen M.A., Chuang I.L., Quantum computation and quantum information, (2000)
[10]  
Glos A., Miszczak J.A., Impact of the malicious input data modification on the efficiency of quantum spatial search, Quantum Inf Process, 18, (2019)