Abstract
The need of true random number generators for many purposes (ranging from applications in cryptography and stochastic simulation, to search heuristics and game playing) is increasing every day. Many sources of randomness possess the property of stationarity. However, while a biased die may be a good source of entropy, many applications require input in the form of unbiased bits, rather than biased ones. In this paper, we present a new technique for simulating fair coin flips using a biased, stationary source of randomness. Moreover, the same technique can also be used to improve some of the properties of pseudo random number generators. In particular, an improved pseudo random number generator has almost unmeasurable period, uniform distribution of the letters, pairs of letters, triples of letters, and so on, and passes many statistical tests of randomness. Our algorithm for simulating fair coin flips using a biased, stationary source of randomness (or for improving the properties of pseudo random number generators) is designed by using quasigroup string transformations and its properties are mathematically provable. It is very flexible, the input/output strings can be of 2-bits letters, 4-bits letters, bytes, 2-bytes letters, and so on. It is of linear complexity and it needs less than 1Kb memory space in its 2-bits and 4-bits implementations, hence it is suitable for embedded systems as well.
Chapter PDF
References
Gude, M.: Concept for a high-performance random number generator based on physical random phenomena. Frequenz 39, 187–190 (1985)
Agnew, G.B.: Random sources for cryptographic systems. In: Price, W.L., Chaum, D. (eds.) EUROCRYPT 1987. LNCS, vol. 304, pp. 77–81. Springer, Heidelberg (1988)
von Neumann, J.: Various techniques used in connection with random digits. In: Collected Works, vol. 5, pp. 768–770. Pergamon Press, Oxford (1963)
Elias, P.: The efficient construction of an unbiased random sequence. Ann. Math. Statist. 43(3), 865–870 (1972)
Stout, Q.F., Warren, B.L.: Tree algorithms for unbiased coin tossing with a biased coin. Ann. Probab. 12(1), 212–222 (1984)
Juels, A., Jakobsson, M., Shriver, E., Hillyer, B.K.: How to Turn Loaded Dice into Fair Coins. IEEE Transactions on Information Theory 46(3), 911–921 (2000)
Dénes, J., Keedwell, A.D.: Latin Squares and their Applications. English Univer. Press Ltd. (1974)
Markovski, S., Gligoroski, D., Bakeva, V.: Quasigroup String Processing: Part 1. Contributions, Sec. Math. Tech. Sci., MANU XX(1-2), 13–28 (1999)
Markovski, S.: Quasigroup string processing and applications in cryptography. In: Proc. 1-st Inter. Conf. Mathematics and Informatics for industry MII, Thessaloniki, pp. 278–290 (2003)
Markovski, S., Kusakatov, V.: Quasigroup String Processing: Part 2. Contributions, Sec. Math. Tech. Sci., MANU XXI(1-2), 15–32 (2000)
Markovski, S., Kusakatov, V.: Quasigroup string processing: Part 3. Contributions, Sec. Math. Tech. Sci., MANU XXIII-XXIV(1-2), 7–27 (2002-2003)
Dimitrova, V., Markovski, J.: On quasigroup pseudo random sequence generator. In: Manolopoulos, Y., Spirakis, P. (eds.) Proc. of the 1-st Balkan Conference in Informatics, Thessaloniki, pp. 393–401 (2004)
Markovski, S., Gligoroski, D., Markovski, J.: Classification of quasigroups by using random wolk on torus. Tech. Report, RISC-LINZ (2004), http://www.risc.uni-linz.ac.at/about/conferences/IJCAR-WS7
Gusev, M., Markovski, S., Gligoroski, G. Kocarev, L.J.: Processor Array Realization of Quasigroup String Transformations. Tech. Report, 01-2005, II-PMF Skopje (2005)
Markovski, S., Gligoroski, D., Bakeva, V.: Quasigroup and Hash Functions, Disc. Math. and Appl. In: Shtrakov, S., Denecke, K. (eds.) Proceedings of the 6th ICDMA, Bansko 2001, pp. 43–50 (2001)
Gligoroski, D., Markovski, S., Bakeva, V.: On Infinite Class of Strongly Collision Resistant Hash Functions ”EDON-F” with Variable Length of Output. In: Proc. 1-st Inter. Conf. Mathematics and Informatics for industry MII, Thessaloniki, pp. 302–308 (2003)
Gligoroski, G., Markovski, S., Kocarev, Lj.: On a family of stream ciphers ”EDON”. Tech. Report, 10-2004, II-PMF Skopje (2004)
McKay, B.D., Meynert, A., Myrvold, W.: Small Latin Squares, Quaisgroups and Loops, http://csr.uvic.ca/~wendym/ls.ps
Hall, M.: Combinatorial theory. Blaisdell Publishing Company, Massachusetts (1967)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Markovski, S., Gligoroski, D., Kocarev, L. (2005). Unbiased Random Sequences from Quasigroup String Transformations. In: Gilbert, H., Handschuh, H. (eds) Fast Software Encryption. FSE 2005. Lecture Notes in Computer Science, vol 3557. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11502760_11
Download citation
DOI: https://doi.org/10.1007/11502760_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26541-2
Online ISBN: 978-3-540-31669-5
eBook Packages: Computer ScienceComputer Science (R0)