Browse > Article
http://dx.doi.org/10.9708/jksci/2012.17.12.149

A Hybrid Randomizing Function Based on Elias and Peres Method  

Pae, Sung-Il (Dept. of Computer Engineering, Hongik University)
Kim, Min-Su (Dept. of Computer Engineering, Hongik University)
Publication Information
Journal of the Korea Society of Computer and Information / v.17, no.12, 2012 , pp. 149-158 More about this Journal
Abstract
Proposed is a hybrid randomizing function using two asymptotically optimal randomizing functions: Elias function and Peres function. Randomizing function is an mathematical abstraction of producing a uniform random bits from a source of randomness with bias. It is known that the output rate of Elias function and Peres function approaches to the information-theoretic upper bound. Especially, for each fixed input length, Elias function is optimal. However, its computation is relatively complicated and depends on input lengths. On the contrary, Peres function is defined by a simple recursion. So its computation is much simpler, uniform over the input lengths, and runs on a small footprint. In view of this tradeoff between computational complexity and output efficiency, we propose a hybrid randomizing function that has strengths of the two randomizing functions and analyze it.
Keywords
randomizing function; Elias function; Peres function; random number generation;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Donald E. Knuth. The Art of Computer Programming, Seminumerical Algorithms, volume 2. Addison-Wesley, third edition, 1998.
2 Benjamin Jun and Paul Kocher. The INTEL Random Number Generator, Cryptography Research, Inc. White paper prepared for INTEL Corporation, April 22, 1999.
3 John von Neumann. Various techniques for use in connection with random digits. Notes by G. E. Forsythe. In Monte Carlo Method, Applied Mathematics Series, volume 12, pages 36-38. U.S. National Bureau of Standards, Washington D.C., 1951. Reprinted in von Neumann's Collected Works 5 (Pergammon Press, 1963), 768-770.
4 Sung-il Pae and Michael C. Loui. Optimal random number generation from a biased coin. In Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 1079-1088, January 2005.
5 Sung-il Pae and Michael C. Loui. Randomizing functions: Simulation of discrete probability distribution using a source of unknown distribution. IEEE Transactions on Information Theory, 52(11):4965-4976, November 2006.   DOI   ScienceOn
6 Claude Elwood Shannon and Warren Weaver. The Mathematical Theory of Communication. The University of Illinois Press, Urbana, 1964.
7 Thomas M. Cover and Joy A. Thomas. Elements of Information Theory. Wiley Series in Telecommunications. John Wiley & Sons, New York, NY, USA, 1991.
8 Peter Elias. The efficient construction of an unbiased random sequence. The Annals of Mathematical Statistics, 43(3):865-870, 1972.   DOI
9 B. Y. Ryabko, E. Matchikina, Fast and efficient construction of an unbiased random sequence, IEEE Transactions on Information Theory 46 (3) (2000) 1090-1093.   DOI   ScienceOn
10 Yuval Peres. Iterating von Neumann's procedure for extracting random bits. Annals of Statistics, 20(1):590-597, 1992.   DOI
11 Sung-il Pae. Exact Computation of Output Rate of Peres's Algorithm for Random Number Generation, submitted.
12 Min-su Kim, A Hybrid Randomizing Function Using Peres-Elias Method for Efficient Generation of Random Bits, Master's thesis, Hongik University, 2012.