I'm not realy experienced with programming and such but I am wondering if the following could be implemented in, lets say, python
we have the following ciphertext sequence
AO AP AL EE IL OP QR IV OD DD GH DK OL FK PO AD GG PO FK OL DK GH OL OT RI DH SK
and I know part of the plaintext says:
Than for sure, I know that of the chipher text the following part:
[GH DK OL FK PO AD GG PO FK OL DK GH] = risetovotesir
GH = 'r' ,
DK = i
Now, lets say the ciphertext would be 400 times longer but does not have such pattern in it again, is there a way to "search" for such thing ?
I'm sorry if I explained this too vaguely, but I'd be happy if anyone could tell me how this would be possible.