International Research Journal of Engineering and Technology (IRJET)
e-ISSN: 2395-0056
Volume: 10 Issue: 04 | Apr 2023
p-ISSN: 2395-0072
www.irjet.net
Quantum Implementation of RSA Crypto-algorithm using IBM-QISKIT Pallavi Verma1, Dr. Palla Penchalaiah 2 1Student, VIII Semester, B.Tech(ECE), VIT University, Vellore, Tamil Nadu, India
(E-mail: pallavi.verma2019@vitstudent.ac.in)
2Associate Professor, Dept. of Micro & Nano Electronics, VIT University, Vellore, Tamil Nadu, India
---------------------------------------------------------------------***---------------------------------------------------------------------
Abstract - Quantum computers have the potential to break
In this context, the quantum implementation of RSA using Qiskit(IBM) has emerged as a promising approach. By leveraging the power of quantum mechanics, Qiskit can provide efficient solutions for the complex mathematical operations required by RSA. This quantum implementation of RSA using Qiskit has the potential to enhance the security of data transmission and storage, and pave the way for the development of next-generation cryptography.[1]
classical RSA encryption, which could lead to the loss of sensitive information, financial data, and other confidential information. To address this issue, a new generation of cryptography called quantum cryptography has emerged. Quantum cryptography exploits the principles of quantum mechanics for encryption & decryption, making it impossible for hackers to break. However, the implementation of quantum cryptography is still in its early stages. The motivation behind this project is to explore the feasibility of using quantum computing to enhance the security of traditional cryptographic techniques. The project aims to implement the RSA encryption algorithm on a quantum computer such as IBM-QISKIT platform. This will evince the potential of quantum computing in the field of cryptography. Specifically, the aim is to investigate and compare the efficiency, accuracy, and security of potential different methods for quantum implementation of RSA: (1) Montgomery multiplication, (2) Chinese remainder theorem, (3) Shor’s Algorithm.
1.1 What is a QUBIT? In quantum computing, a qubit or quantum bit is a basic unit of quantum information—the quantum version of the classic binary bit physically realized with a two-state device. A qubit is a two-state (or two-level) quantum-mechanical system, one of the simplest quantum systems displaying the peculiarity of quantum mechanics. Examples include the spin of the electron in which the two levels can be taken as spin up and spin down; or the polarization of a single photon in which the two states can be taken to be the vertical polarization and the horizontal polarization.[2]
Key Words: Quantum Computing, IBM-QISKIT, RSA, Chinese Remainder Theorem, Montgomery Multiplication, Shor’s Algorithm
In a classical system, a bit would have to be in one state or the other. However, quantum mechanics allows the qubit to be in a coherent superposition of both states simultaneously, a property that is fundamental to quantum mechanics and quantum computing. In addition to superposition, qubits can also exhibit a phenomenon called entanglement. This means that the state of one qubit is directly related to the state of another qubit, even if they are separated by large distances.
1. INTRODUCTION Quantum computing is a game-changing technology that promises to revolutionize the world of computing as we know it. Traditional computers work with binary digits, known as bits, which can be either 0 or 1. However, quantum computers use quantum bits, or qubits, which can exist in multiple states simultaneously. This property of qubits allows quantum computers to perform certain calculations exponentially faster than classical computers, making them ideal for solving complex problems in fields such as cryptography, drug discovery, and artificial intelligence. The RSA algorithm is a widely used and trusted encryption method that relies on the difficulty of factoring large composite numbers. However, the security of RSA can be compromised by quantum computers, which can efficiently factor such numbers using Shor's algorithm. To counter this, there has been growing interest in implementing RSA using quantum computing techniques, which can provide an additional layer of security against quantum attacks.
© 2023, IRJET
|
Impact Factor value: 8.226
1.2 The BLOCH Sphere The Bloch sphere is like a map of all the possible states that a single qubit can be in. Imagine a sphere, like a beach ball, where each point on the surface represents a different state of the qubit. The north pole of the sphere represents a qubit that is definitely in the state "0", and the south pole represents a qubit that is definitely in the state "1". All other points on the sphere represent a superposition of the "0" and "1" states. The Bloch sphere is important because it helps us to visualize and understand how qubits work. By looking at the Bloch sphere, we can see how different quantum gates (like the X, Y, and Z gates) affect the state of a qubit. We can also see how measurements collapse the state of a qubit to either "0" or "1".[3]
|
ISO 9001:2008 Certified Journal
|
Page 1282