[2021.06.17] An Efficient Quantum Computing technique for cracking RSA using Shor’s Algorithm

Dear all,

I will share a paper titled "An Efficient Quantum Computing technique for cracking RSA using Shor’s Algorithm" published from IEEE ICCCA on Oct. 2020.

The below is the abstract of the paper and let me attach the draft of presentation

Quantum Computing is a prominent word in this era as it allows computation to be performed in no time. The motive of using Quantum Computing (QC) is that even exponentially large number of problems can be solved using it which was earlier difficult with the classical computing. Conventional methods are based on usage of bits which consist of 0's and 1's while QC works with qubits. The main issue is that conventional computing has issue of storage as well as computation even when parallel computation is performed on it. Concept of quantum parallelism allows the computation to be performed in exponentially very low time as compared to conventional method. This paper will discuss about Quantum Computing Algorithms and how Shor’s algorithm is able to break RSA algorithms is discussed. Entanglement and superposition of qubits helps fast computation. The demonstration of the applicability has been evaluated based on Computation time, storage capacity, accuracy, confidentiality, efficiency, integrity, and availability. Among various algorithms Shor’s technique is able to break various encryption algorithm with more supremacy as compared to conventional computing methods. In nutshell, paper will discuss about various QC algorithms and will illustrate how shor’s algorithm is able to crack RSA.

Thanks
Sungmin.