Content area
Abstract
Randomness is a crucial part of computer science, finding usage in areas such as data science, machine learning, and cryptography. Replication of true randomness (which is only found in nature) over the years by using pseudo-random generators (PRNGs) has posed limitations and potential vulnerability. A major threat is the development of quantum computers, which have been stated to potentially break simple encryptions with the advent of quantum algorithms such as Shor’s algorithm. The inherent randomness found in nature has been called on with the invention of quantum random number generators (QRNGs) to combat this threat by switching to quantum-secure alternatives to the existing standard. This research thesis aims to compare the efficiency of PRNGs and QRNGs from a time and memory complexity standpoint, as well as their statistical properties, and cryptographic robustness. The study focuses on two well-known effective PRNGs and a quantum random number generator which is built on photon counting. This research aims to explore the potential for QRNGs to replace PRNGs in areas where they offer greater benefits.
