Fetching the paper…
Reading the bibliography…
Even if the output of a Random Number Generator (RNG) is perfectly uniformly distributed, it may be correlated to pre-existing information and therefore be predictable.
Nicholas Metropolisand Stanislaw Ulam, “The Monte Carlo method,” Journal of the American Statistical Association 44
1949
Earlier work this paper cites.
J. L. Carter and M. N. Wegman, “Universal classes of hash functions,” Journal of Computer and System Sciences 18
1979
Earlier work this paper cites.
M. N. Wegman and J. L. Carter, “New hash functions and their use in authentication and set equality,” Journal of Computer and System Sciences 22
1981
Earlier work this paper cites.
C. H. Bennett, G. Brassard, and J.-M. Robert, “Privacy amplification by public discussion,” SIAM Journal on Computing Comput. 17
1988
Earlier work this paper cites.
R. Impagliazzo, L. A. Levin, and M. Luby, “Pseudo-random generation from one-way functions,” Proceedings 21st Annual ACM Symposium on Theory of Computing , 12–24 (1989)
1989
Earlier work this paper cites.
R. Impagliazzo and D. Zuckerman, “How to recycle random bits,” 30th Annual Symposium of Foundations of Computer Science , 248–253 (1989)
1989
Earlier work this paper cites.
Asher Peres, “Neumark’s theorem and quantum inseparability,” Foundations of Physics 20
1990
Earlier work this paper cites.
C. H. Bennett, G. Brassard, C. Crepeau, and U. M. Maurer, “Generalized privacy amplification,” IEEE Transactions on Information Theory 41
1995
Earlier work this paper cites.
N. Nisan and D. Zuckerman, “Randomness is linear in space,” Journal of Computer and System Sciences 52
1996
Earlier work this paper cites.
Michael A Nielsen and Isaac L Chuang, “Quantum computation and quantum information,” (2000)
2000
Earlier work this paper cites.
Huang Zhun and Chen Hongyi, “A truly random number generator based on thermal noise,” Proceedings of the 4th International Conference on ASIC , 862–864 (2001)
2001
Earlier work this paper cites.
L. Trevisan, “Extractors and pseudorandom generators,” Journal of the ACM 48
2001
Earlier work this paper cites.
R. Shaltiel, “Recent developments in explicit constructions of extractors,” Bulletin of the European Association for Theoretical Computer Science 77
2002
Earlier work this paper cites.
D. R. Stinson, “Universal hash families and the leftover hash lemma, and applications to cryptography and computing,” Journal of Combinatorial Mathematics and Combinatorial Computing 42
2002
Cited alongside, same era.
Ulf Leonhardt, “Quantum physics of simple optical instruments,” Reports on Progressing Physics 66
2003
Cited alongside, same era.
R Alicki and M Fannes, “Continuity of quantum conditional information,” Journal of Physics A 31
2004
Cited alongside, same era.
Renato Renner and Robert König, “Universally composable privacy amplification against quantum adversaries,” Proceedings of the Theory of Cryptogaphy Conference 3378
2005
Cited alongside, same era.
Giacomo Mauro D’Ariano, Paoloplacido Lo Presti, and Paolo Perinotti, “Classical randomness in quantum measurements,” Journal of Physics A 38
Christian Gabriel, Christoffer Wittmann, Denis Sych, Ruifang Dong, Wolfgang Mauerer, Ulrik L. Andersen, Christoph Marquardt, and Gerd Leuchs, “A generator for unique quantum random numbers based on vacuum states,” Nature Photonics 4
2010
Later among the works it cites.
S. Pironio, A. Acín, S. Massar, A. Boyer de la Giroday, D. N. Matsukevich, P. Maunz, S. Olmschenk, D. Hayes, L. Luo, T. A. Manning, and C. Monroe, “Random numbers certified by Bell’s theorem,” Nature 464
2010
Later among the works it cites.
M. Stipcevic, “Quantum random number generators and their use in cryptography,” MIPRO, 2011 Proceedings of the 34th International Convention , 1474–1479 (2011)
2011
Later among the works it cites.
Roger Colbeck and Renato Renner, “No extension of quantum theory can have improved predictive power,” Nature Communications 2
2011
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2005
Cited alongside, same era.
Renato Renner, “Security of Quantum Key Distribution,” Ph.D thesis, available on arXiv:quant-ph/0512258 (2006)
2006
Cited alongside, same era.
Ming Li and Paul M.B. Vitányi, An Introduction to Kolmogorov Complexity and Its Applications (Springer, 2008)
2008
Cited alongside, same era.
R. König and B. M. Terhal, “The bounded-storage model in the presence of a quantum adversary,” IEEE Transactions on Information Theory 54
2008
Cited alongside, same era.
A. Ta-Shma, “Short seed extractors against quantum storage,” Proceedings of the 41st Symposium on Theory of Computing , 401–408 (2009)
2009
Cited alongside, same era.
2009
Cited alongside, same era.
Robert König, Renato Renner, and Christian Schaffner, “The operational meaning of min- and max-entropy,” IEEE Transactions on Information Theory 55
2009
Cited alongside, same era.
Marco Tomamichel, Christian Schaffner, Adam Smith, and Renato Renner, “Leftover hashing against quantum side information,” IEEE Transactions on Information Theory 57
2010
Cited alongside, same era.
Arjen K. Lenstra, James P. Hughes, Maxime Augier, Joppe W. Bos, Thorsten Kleinjung, and Christophe Wachter, “Public keys,” in Advances in Cryptology – CRYPTO 2012 , Vol. 7417, edited by Springer (2012) pp. 626–642
2012
Later among the works it cites.
Ben-Aroya and A. Ta-Shma, “Better short-seed quantum-proof extractors,” Theoretical Computer Science (2012)
2012
Later among the works it cites.
A. De, C. Portmann, T. Vidick, and R. Renner, “Trevisan’s extractor in the presence of quantum side information,” SIAM Journal on Computing 41
2012
Later among the works it cites.
2012
Later among the works it cites.
Matthias Troyer and Renato Renner, “A randomness extractor for the Quantis device,” http://www.idquantique.com/images/ stories/PDF/quantis-random-generator/quantis-rndextract-techpaper.pdf (2012)
2012
Later among the works it cites.
Roger Colbeck and Renato Renner, “Free randomness can be amplified,” Nature Physics 8
2012
Later among the works it cites.
N.J. Beaudry and R. Renner, “An intuitive proof of the data processing inequality,” Quantum Information and Computation 12
2012
Later among the works it cites.