Perl: the Markov chain saw | |
PerlMonks |
Re: Re: Re: Re: Encrypting Largish Filesby John M. Dlugosz (Monsignor) |
on Sep 27, 2001 at 01:01 UTC ( [id://114936]=note: print w/replies, xml ) | Need Help?? |
256! (factorial), not 256*8. Start with the list 0..255 and shuffle it. That list is 2048 bits long, but you will never have, for example, two bytes both containing 42. So the number of legal states is smaller than the number of states that this much memory can represent. 7.21e15 vs 4.5e15 : within a factor of 2 (1 bit). Fractional bits don't count, so round down. 2^52 is a little small, but 2^53 is too large. —John
In Section
Seekers of Perl Wisdom
|
|