An ultrafast quantum random number generator with provably bounded output bias based on photon arrival time measurements

Applied Physics Letters

Volumn 98, Issue 17, 2011, Pages

  Wahl, Michael ^a   Leifgen, Matthias ^b   Berlin, Michael ^b   Röhlicke, Tino ^a   Rahn, Hans Jürgen ^a   Benson, Oliver ^b  

^a PICOQUANT GMBH   (Germany)

^b HUMBOLDT UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARRIVAL TIME; BIT RATES; CURRENT GENERATOR; EXPONENTIAL DISTRIBUTIONS; FIELD PROGRAMMABLE LOGIC; HIGH RESOLUTION; PHOTON ARRIVAL; RANDOM NUMBER GENERATORS; ULTRA-FAST;

NUMBER THEORY; PHOTONS; TIME MEASUREMENT;

RANDOM NUMBER GENERATION;

EID: 79955689736     PISSN: 00036951     EISSN: None     Source Type: Journal    
DOI: 10.1063/1.3578456     Document Type: Article

References (20)

1. N. Gisin, G. Ribordy, W. Tittel, and H. Zbinden, Rev. Mod. Phys. 0034-6861 74, 145 (2002). 10.1103/RevModPhys.74.145
2. A. Stefanov, N. Gisin, O. Guinnard, L. Guinnard, and H. Zbinden, J. Mod. Opt. 0950-0340 47, 595 (2000). 10.1080/09500340008233380
3. M. A. Wayne, E. R. Jeffrey, G. M. Akselrod, and P. G. Kwiat, J. Mod. Opt. 0950-0340 56, 0516 (2009). 10.1080/09500340802553244
4. M. Fürst, H. Weier, S. Nauerth, D. G. Marangon, C. Kurtsiefer, and H. Weinfurter, Opt. Express 1094-4087 18, 13029 (2010). 10.1364/OE.18.013029
5. M. A. Wayne and P. G. Kwiat, Opt. Express 1094-4087 18, 9351 (2010). 10.1364/OE.18.009351
6. M. Wahl, H. -J. Rahn, T. Röhlicke, G. Kell, D. Nettels, F. Hillger, B. Schuler, and R. Erdmann, Rev. Sci. Instrum. 0034-6748 79, 123113 (2008). 10.1063/1.3055912
7. S. K. Sanadhya and P. Sarkar, Information Security and Privacy Lecture Notes in Computer Science (Springer, Berlin, 2008), Vol. 5107, pp. 254-266.
8. S. Indesteege, F. Mendel, B. Preneel, and C. Rechberger, Selected Areas in Cryptography Lecture Notes in Computer Science (Springer, Berlin, 2009), Vol. 5381.
9. B. Chor, O. Goldreich, J. Hasted, J. Freidmann, S. Rudich, and R. Smolensky, Proceedings of the IEEE Annual Symposium on Foundations of Computer Science, (IEEE, Los Alamitos, CA, 1985), pp. 396-407.
10. B. Sunar, W. J. Martin, and D. R. Stinson, IEEE Trans. Comput. 0018-9340 56, 109 (2007). 10.1109/TC.2007.250627
11. D. Schellekens, B. Preneel, and I. Verbauwhede, CiteSeer, http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.86.5319, 2006.
12. P. Lacharme, Proceedings of FSE (Springer, Berlin, 2008), pp. 334-342.
13. P. Lacharme, IEEE Trans. Inf. Theory 0018-9448 55, 4742 (2009). 10.1109/TIT.2009.2027483
14. D. B. Thomas and W. Luk, Proceedings of FPL, 23 September 2008.
15. Further detection during the dead time does not change the length of the dead time.
16. Data extracted with 8 bits actually passed statistical testing and resulted in a bitrate of 76 Mbit/s.
17. R. C. Bose and D. K. Ray-Chaudhuri, Inf. Control 3, 6879 (1960). 0019-9958
18. For critical cryptographic applications the resilient function may be chosen with higher compression to limit the extracted number of bits per photon to min-entropy, 14.6 bits in our case.
19. P. L'Ecuyer and R. Simard, ACM Trans. Math. Softw. 0098-3500 33, 22 (2007). 10.1145/1268776.1268777 (Pubitemid 47330739)
20. For bitrates of other QRNGs, see http://qrbg.irb.hr/, http://www.qutools.com/products/quRNG/index.php?page=3, http://www.idquantique. com/ordering/shop.html.