First of all I would like to say hello to all StackExchange users. So far I've been stalking the forum for some time, now it's time to leave the shadows.
In my master thesis I'm writing about heuristic methods in cryptanalysis, etc. ant colony algorithms or genetic algorithms. So far all methods seems to be quite intuitive, but I've got a problem in implementing part of them - most of these methods assume that key length is known. For substitution ciphers there are well known methods (Kasiski test, index of coincidence) of key length recovery.
Unfortunately I can't find any method of recovery key length in transposition block cipher (permutation cipher). Do you know such methods?
All best to you