Abstract
Algorithmic post-processing is used to overcome statistical deficiencies of physical random number generators. We show that the quasigroup based approach for post-processing random numbers described in [MGK05] is ineffective and very easy to attack. We also suggest new algorithms which extract considerably more entropy from their input than the known algorithms with an upper bound for the number of input bits needed before the next output is produced.
Keywords
References
Juels, A., Jakobsson, M., Shriver, E., Hillyer, B.K.: How to turn loaded dice into fair coins. IEEE Trans. Information Theory 46(3), 911–921 (2000)
Killmann, W., Schindler, W.: A proposal for: Functionality classes and evaluation methodology for true (physical) random number generators (2001), http://www.bsi.bund.de/zertifiz/zert/interpr/trngk31e.pdf
Markovski, S., Gligoroski, D., Kocarev, L.: Unbiased random sequences from quasigroup string transformations. In: Gilbert, H., Handschuh, H. (eds.) FSE 2005. LNCS, vol. 3557, pp. 163–180. Springer, Heidelberg (2005)
Peres, Y.: Iterating von Neumann’s procedure for extracting random bits. The Annals of Statistics 20(3), 590–597 (1992)
von Neumann, J.: Various techniques for use in connection with random digits. In: von Neumann’s Collected Works, vol. 5, pp. 768–770. Pergamon, Oxford (1963)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dichtl, M. (2007). Bad and Good Ways of Post-processing Biased Physical Random Numbers. In: Biryukov, A. (eds) Fast Software Encryption. FSE 2007. Lecture Notes in Computer Science, vol 4593. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74619-5_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-74619-5_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74617-1
Online ISBN: 978-3-540-74619-5
eBook Packages: Computer ScienceComputer Science (R0)