(04-10-2021, 08:13 PM)Mark Knowles wrote: You are not allowed to view links. Register or Login to view.If ($&#) = ($&)(#) = ($)(&#) in 3 different readings then of course it may well be that only one of these fits the context.
Here we have three mappings. I understand this doesn't fit the conversation on the blog, sorry. I was thinking of possible limitations, ways to rule out mappings easily with such a criterion as "no substrings allowed". A string and some of its substrings (at the start or end) coding for different cleartext letters at the same place (one of the three places of ciphertext words; first, middle, last in this case as every ciphertext word is made up of three parts) are not necessarily ambiguous. It actually happens in my sample cipher, without any danger of confusion because only one choice of part1, part2, part3 is possible for each word of the ciphertext.