Post-processing functions are used to reduce the imperfectness of physical random number generators. At FSE '07, Dichtl considered the case where the physical random number generator outputs independent bits that have a constant bias, and the post-processing function has fixed input and output lengths. In this paper, we first present a number of bounds on deg(n,m), which is a measure of the reduction of biases with n-bit input and m-bit output post-processing functions. We next show the exact values of deg(n,m) for a large class of (n,m) such that 1 ≤ m ≤ n ≤ 16, by using the bounds on deg(n,m) and a computer simulation. We finally discuss how we have derived these numerical values. © 2009 Springer.
CITATION STYLE
Suzuki, K., & Iwata, T. (2008). Bounds on fixed input/output length post-processing functions for biased physical random number generators. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5381 LNCS, pp. 373–386). https://doi.org/10.1007/978-3-642-04159-4_24
Mendeley helps you to discover research relevant for your work.