{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/11979"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/11979","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Photon Arrival Time Quantum 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 would allow. 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.","abstract_html":"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 would allow. 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.","abstract_has_math":false,"creators":["Wayne, Michael A."],"institution":"University of Illinois at Urbana-Champaign","degree_name":"M.S.","degree_level":"Thesis","degree_discipline":"Electrical and Computer Engineering","degree_department":null,"school":null,"contributors":["Kwiat, Paul G."],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2009,"date_issued":"2009-06-01T16:05:11Z","date_published":"2009-06-01T16:05:11Z","updated_at":"2026-07-22T22:24:52Z","subjects":["quantum information, quantum cryptography, random number generation"],"languages":[],"rights":["Copyright 2009 Michael Alan Wayne"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/2142/11979","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Kwiat, Paul G."]},{"key":"dc:creator","label":"Author","values":["Wayne, Michael A."]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2009-06-01T16:05:11Z","2009-5"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Electrical and Computer Engineering"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["M.S."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["quantum information, quantum cryptography, random number generation"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:rights","label":"Dc Rights","values":["Copyright 2009 Michael Alan Wayne"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/11979"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["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 would allow. 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.","Item deposited via ETD process 2009-06-01.","Made available in DSpace on 2009-06-01T16:05:11Z (GMT). No. of bitstreams: 2 license.txt: 4061 bytes, checksum: b31822a60e948eb41d6c2f9385a3417e (MD5) Wayne_Michael.pdf: 806597 bytes, checksum: 411cc1992fbcb80b3246d58069863666 (MD5)"]},{"key":"dc:title","label":"Title","values":["Photon Arrival Time Quantum Random Number Generation"]}]}],"canonical_facts":{"dc:contributor":["Kwiat, Paul G."],"dc:creator":["Wayne, Michael A."],"dc:date":["2009-06-01T16:05:11Z","2009-5"],"dc:description":["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 would allow. 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.","Item deposited via ETD process 2009-06-01.","Made available in DSpace on 2009-06-01T16:05:11Z (GMT). No. of bitstreams: 2 license.txt: 4061 bytes, checksum: b31822a60e948eb41d6c2f9385a3417e (MD5) Wayne_Michael.pdf: 806597 bytes, checksum: 411cc1992fbcb80b3246d58069863666 (MD5)"],"dc:identifier":["http://hdl.handle.net/2142/11979"],"dc:rights":["Copyright 2009 Michael Alan Wayne"],"dc:subject":["quantum information, quantum cryptography, random number generation"],"dc:title":["Photon Arrival Time Quantum Random Number Generation"],"thesis:degree_discipline":["Electrical and Computer Engineering"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["M.S."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:24:52Z"}