Hot answers tagged permutation
If you can generate uniform random numbers, you can use a variant of Fisher-Yates. //given an array s with the elements to be permuted for i from n-1 to 1: t = rand(0, i) # inclusive swap(s[i], s[t])
A while ago, I spent time playing with modern field/pen & paper ciphers, especially with Card-Chameleon. Card-Chameleon needs two separate full alphabet permutations as a key. As it's a field/pen & paper cipher, I tried to find a computer-less, math-less, way to generate these permutations from passwords. My solution is a two steps process. Let's ...
Only top voted, non community-wiki answers of a minimum length are eligible