On Thu, May 09, 2013 at 10:01:09PM -0700, travis+ml-rbcryptogra...@subspacefield.org wrote: > http://en.wikipedia.org/wiki/Knuth_shuffle > > Anything that works without a table? > I'm assuming you won't have a key to represent all (2^n)! permutations so... > For even a large subset of all permutations?
i have this naive algo where i generate a random number with n! as an upper limit, and then convert the resulting number into base n, where each digit then is an index to the unshuffled/ordered list of all elements. dunno if that fits your expectations. -- pgp: https://www.ctrlc.hu/~stef/stef.gpg pgp fp: FD52 DABD 5224 7F9C 63C6 3C12 FC97 D29F CA05 57EF otr fp: https://www.ctrlc.hu/~stef/otr.txt _______________________________________________ cryptography mailing list cryptography@randombit.net http://lists.randombit.net/mailman/listinfo/cryptography
