|Title:||Photon Arrival Time Quantum Random Number Generation
|Author(s):||Wayne, Michael A.
|Advisor(s):||Kwiat, Paul G.
|Department / Program:||Electrical and Computer Engineering
|Discipline:||Electrical and Computer Engineering
|Degree Granting Institution:||University of Illinois at Urbana-Champaign
|Subject(s):||quantum information, quantum cryptography, random number generation
|Abstract:||A quantum random number generator (QRNG) is one which re-
lies on a physical process, extracting randomness from the inherent
uncertainty in quantum mechanics. This is to be contrasted with
current pseudo-random number generators (PRNG), which although
useful, are in fact deterministic: they always yield the same output
sequence given the same input seed. This is unacceptable for some
applications, such as quantum cryptography, which promise uncon-
ditional security. Unfortunately, the rate of QRNGs is still too slow
for practical commercial quantum key distribution systems (which
presently run at speeds over 1 GHz).
Previous QRNGs have been implemented, with the most common
relying on the behavior of a photon at a beam-splitter, producing
a random bit dependent on which of the two paths in which the
photon is detected. However, these are totally limited by detector
saturation rates, typically in the low MHz range. We previously
proposed that by instead using the time interval between detections,
much more random information could be extracted per detection
event. Specifically, instead of only one bit per detection, in principle
one could extract as many bits as the measurement time resolution
Over the past two years, we have been exploring this approach
and have constructed a functional QRNG operating at rates up to
130 Mbit/s. The random output has been tested and has passed all
common cryptographic random number tests.
|Rights Information:||Copyright 2009 Michael Alan Wayne
|Date Available in IDEALS:||2009-06-01
|Date Deposited:||May 2009