Human being is a living random number generator.pdf

True random bits can be generated by algorithmic process Arindam Mitra Anushakti Abasan, Lubdhak -1, 1/AF, Salt lake, Kolkata, West Bengal, 700064, India. Abstract The idea of generating true random numbers by algorithmic process is believed to be one of the most highly prohibited ideas in mathematics. However, no mathematical proof rules out the existence of such algorithm. We present an incredibly simple and optimally fast algorithm for the generation of arbitrary number of true random bits. The algorithm does not require any mathematical formula and is initiated by the random physical process because it needs some true random bits in the input. Generated random bits in the output cannot be distinguished from random bits generated by random physical process. Algorithm can be used to generate completely secure key for cryptographic application. Introduction There is a great demand for random numbers for different purposes [1-2]. With the advent of computer the demand is growing more and more. All known random number generator algorithms [1,2] are essentially pseudo-random number generators. It is well known that true random numbers can be generated by random physical process such as radio-active decay. But random physical process cannot generate random numbers quickly. Although there is no universally accepted finer definition [3,4] of randomness but there is general belief that true random number generator cannot be deterministic in nature. Let us recall von Neumann’s famous warning: “Anyone attempts to generate random numbers in a deterministic process is, of course, living in a state of sin”. That is, von Neumann ruled out the existence of deterministic algorithm for true random number generation. Let us conjecture that an algorithm does generate all probable distributions of random bits in a particular order. It is impossible to tell whether these distributions have been generated by