I wanted to try the Fisher-Yates shuffling algorithm for adding an unbiased randomization to the seed data in AES encryption. Looks like the output is fairly uniformly random; I'll add an encryption demo shortly. The Fisher-Yates algorithm can still be defeated by predicting the Math.random() output, and also, there's a statistical issue limiting the possible number of shuffled arrangements. Meh, I'll figure that out later.