[1] Herrero-Collantes M, Garcia-Escartin J C. Quantum random number generators[J]. Reviews of Modern Physics, 89, 015004(2017).

[2] Boaron A, Korzh B, Houlmann R et al. Simple 2.5 GHz time-Bin quantum key distribution[J]. Applied Physics Letters, 112, 171108(2018).

[3] Symul T, Assad S M, Lam P K. Real time demonstration of high bitrate quantum random number generation with coherent laser light[J]. Applied Physics Letters, 98, 231103(2011).

[4] Yang J, Liu J L, Su Q et al. 5.4 Gbps real time quantum random number generator with simple implementation[J]. Optics Express, 24, 27475-27481(2016).

[5] Kogelnik H, Yariv A K. Considerations of noise and schemes for its reduction in laser amplifiers[J]. Proceedings of the IEEE, 52, 165-172(1964).

[6] Argyris A, Pikasis E, Deligiannidis S et al. Sub-Tb/s physical random bit generators based on direct detection of amplified spontaneous emission signals[J]. Journal of Lightwave Technology, 30, 1329-1334(2012).

[7] Zhang X G, Nie Y Q, Liang H et al. FPGA implementation of Toeplitz hashing extractor for real time post-processing of raw random numbers[C](2016).

[8] Williams C R S, Salevan J C, Li X W et al. Fast physical random number generator using amplified spontaneous emission[J]. Optics Express, 18, 23584-23597(2010).

[9] Wei S H, Yang J, Fan F et al. Compact quantum random number generator based on superluminescent light-emitting diodes[J]. The Review of Scientific Instruments, 88, 123115(2017).

[10] Bustard P J, England D G, Nunn J et al. Quantum random bit generation using energy fluctuations in stimulated Raman scattering[J]. Optics Express, 21, 29350-29357(2013).

[11] Ma X F, Xu F H, Xu H et al. Postprocessing for quantum random-number generators: Entropy evaluation and randomness extraction[J]. Physical Review A, 87, 062327(2013).

[12] Gehring T, Lupo C, Kordts A et al. Homodyne-based quantum random number generator at 2.9 Gbps secure against quantum side-information[J]. Nature Communications, 12, 1-11(2021).

[13] Mansour Y, Nisan N, Tiwari P. The computational complexity of universal hashing[J]. Theoretical Computer Science, 107, 121-133(1993).

[14] Skorski M, Chen K F, Lin D D, Yung M. Evaluating entropy for true random number generators: efficient, robust and provably secure[M]. Information security and cryptology. Lecture notes in computer science, 10143, 526-541(2017).

[15] Peres Y. Iterating von Neumann’s procedure for extracting random bits[J]. The Annals of Statistics, 20, 590-597(1992).

[16] Fan L M, Chen H, Chen M H et al. Corrected runs distribution test for pseudorandom number generators[J]. Electronics Letters, 52, 281-283(2016).

[17] Chaitin G J. On the length of programs for computing finite binary sequences[J]. Journal of the ACM, 13, 547-569(1966).

[18] Liu L F, Miao S X, Liu B C. On nonlinear complexity and Shannon’s entropy of finite length random sequences[J]. Entropy, 17, 1936-1945(2015).