Last week’s installment on columnar transposition ciphers described a formula for the underlying permutation for a CTC. If we assume that the number of columns being used divides the length of the ...
Abstract: It is known that, when n is even, the number of permutations of {1,2,...,n} all of whose cycles have odd length equals the number of those all of whose cycles have even length. Adin, Hegedüs ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback