Hostname: page-component-cd9895bd7-mkpzs Total loading time: 0 Render date: 2024-12-23T23:55:23.125Z Has data issue: false hasContentIssue false
  • English
  • Français

Random Numbers from Astronomical Imaging

Published online by Cambridge University Press:  05 March 2013

Kevin A. Pimbblet  and
Michael Bulmer
Kevin A. Pimbblet*
Affiliation:
Department of Physics, University of Queensland, Brisbane QLD 4072, Australia
Michael Bulmer
Affiliation:
Department of Mathematics, University of Queensland, Brisbane QLD 4072, Australia
*
CCorresponding author. Email: [email protected]
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

This article describes a method to turn astronomical imaging into a random number generator by using the positions of incident cosmic rays and hot pixels to generate bit streams. We subject the resultant bit streams to a battery of standard benchmark statistical tests for randomness and show that these bit streams are statistically the same as a perfect random bit stream. Strategies for improving and building upon this method are outlined.

Keywords

methods: statisticaltechniques: image processingtechniques: miscellaneous
Type
Research Article
Information
Publications of the Astronomical Society of Australia , Volume 22 , Issue 1 , 2005 , pp. 1 - 5
Copyright
Copyright © Astronomical Society of Australia 2005

References

Ballesteros, H. G., & Martín-Mayor, V. 1998, PhRvE, 58, 6787 Google Scholar
Dressler, A., & Shectman, S. A. 1988, AJ, 95, 985 Google Scholar
Ferrenberg, A. M., Landau, D. P., & Wong, Y. J. 1992, PhRvL, 69, 3382 Google Scholar
Gleeson, J. T. 2002, ApPhL, 81, 1949 Google Scholar
González, J. A., & Pino, R. 1999, CoPhC, 120, 109 Google Scholar
James, F. 1990, CoPhC, 60, 329 Google Scholar
Knuth, D. E. 1981, The Art of Computer Programming. Vol. 2: Seminumerical Algorithms (Reading, MA: Addison-Wesley)Google Scholar
Meurers, J. 1969, A&A, 3, 354 Google Scholar
Nemiroff, R. J., & Rafert, J. B. 1999, PASP, 111, 886 Google Scholar
Pimbblet, K. A., & Drinkwater, M. J. 2004, MNRAS, 347, 137 CrossRefGoogle Scholar
Pimbblet, K. A., Smail, I., Kodama, T., Couch, W. J., Edge, A. C., Zabludoff, A. I., & O'Hely, E. 2002, MNRAS, 331, 333 CrossRefGoogle Scholar
Pitman, J. 1993, Probability (New York, NY: Springer)Google Scholar
Press, W. H., Teukolsky, S. A., Vetterling, W. T., & Flannery, B. P. 1992, Numerical Recipes in fortran. The Art of Scientific Computing (Cambridge: CUP)Google Scholar
Revesz, P. 1990, Random Walk in Random and Non-Random Environments (Singapore:World Scientific)CrossRefGoogle Scholar
Rukhin, A., et al. 2001, A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications (Gaithersburg, MD: NIST) (csrc.nist.gov/rng/SP800-22b.pdf)Google Scholar
Tu, S., & Fischbach, E. 2003, PhRvE, 67, 016113Google Scholar
Vavriv, D. D. 2003, Proc. Experimental Chaos (Melville, NY: AIP) 676, 373 Google Scholar
von Neumann, J. 1963, Various Techniques Used in Connection with Random Digits, von Neumann's Collected Works, Vol. 5 (Oxford: Pergamon)Google Scholar