Jagannadha Bhattu wrote:
You won't find such a algorithm which can be implemented on a computer, since you'd have to work with numbers of infinite size. If you use numbers with a finite size (which is the custom on current computers) you can easily (in theory) calculate the possible number of permutations, you'll find a period for every given sample size. Though usually you'll have to search for a VERY long time.Hi,I am not sure if this is the correct mailing list to post this query. I can appreciate anybody who can point me the right one, if this is not the one. After reading about random number generators I did some search in internet and learnt that all the software random number generators have a period. Even the blum blum shub and RSA have the period and that the sequence will repeat it self after some time though the time period is very long. I also read that it is possible to implement a random number generator with a period of the life time of the universe. But this also theoretically has a limit. What I want to know is, is there any algorithm that theoretically has no period.
Computers indeed are not built for eternity... ;)
[...]
Hope it helps, Ted ;) -- PGP Public Key Information Download complete Key from http://www.convey.de/ted/tedkey_convey.asc Key fingerprint = 31B0 E029 BCF9 6605 DAC1 B2E1 0CC8 70F4 7AFB 8D26
smime.p7s
Description: S/MIME Cryptographic Signature
