Publications / Implications of Quantum Superposition in Cryptography: A True Random Number Generation Algorithm

Implications of Quantum Superposition in Cryptography: A True Random Number Generation Algorithm

Dhananjay S. Deshpande , Aman Kumar Nirala and Ayodeji Olalekan Salau

Conference Paper Information and Communication Technology for Intelligent Systems (ICTIS 2020), Smart Innovation, Systems and Technologies, vol 196 October 2020 DOI: 10.1007/978-981-15-7062-9_41
4 citations
Implications of Quantum Superposition in Cryptography: A True Random Number Generation Algorithm

Abstract

This paper addresses the problem of generation of true random numbers by using superposition of qubits in a quantum computer and its application in cryptography. We used QISKIT to create quantum circuits and executed those circuits on a publicly available IBM quantum computer to create an equal probability of getting all possible outcomes i.e. unbiased random output using a few limited random bits (qubits). Furthermore, we explain the physical and mathematical aspects of superposition and random number generation. The results of this study show that in theory, true random number generation is possible on quantum computers and has a lot of application in cryptography. In addition, we show how a truly random seed generated from one of the IBM quantum computers can be used to generate public and private encryption keys using RSA encryption.

Related Topics

# quantum-computing # cryptography # random-number-generation # qubits # superposition