-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Martin Tournoij wrote:
| On Sun, May 25, 2008 at 04:10:01PM -0400, Aryeh M. Friedman wrote:
|> Lets say I have a string of n bits that needs to be filled by repeatedly
|> applying some function on k strings of m bits where |m|<|n|. Assuming
|> that
On Sun, May 25, 2008 at 04:10:01PM -0400, Aryeh M. Friedman wrote:
> Lets say I have a string of n bits that needs to be filled by repeatedly
> applying some function on k strings of m bits where |m|<|n|. Assuming
> that m(i) is a random string and n needs to also be random what is the best
>
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Lets say I have a string of n bits that needs to be filled by repeatedly
applying some function on k strings of m bits where |m|<|n|. Assuming
that m(i) is a random string and n needs to also be random what is the
best way to do this. Note it is
