Now, let us understand this first manually.
Hence, we have come to this accelerate, not so understanding the finding, repeated sequences, you're
not the first step of your examination is to find every disputed set of at least three letters in ciphertext.
Now, these repeated sequences will be the same length of the plaintext, which is encrypted using the
same subcu of the beginning.
For example, if you want to encrypt the plain text, like say.
They'll get.
Is out all of the Mac now, this basically you want to encrypt, let us just make this size small so
that it is easy for us to understand.
So and below that, we would write down the key, which will be using for hacking it.
So the key will be using a safe skill.
No.
Vince,
so again, we will continue
the spin, though, now if you just look at it, if you want to have the text using the key, you will
get your fill.
W m and L m b w b why the v x l w m m l z.
Now, if you look at it over here, this LW M here and the l w m here, this is repeating now this is
repeating twice.
The reason is that in the ciphertext LW M is a plain word though, which is interpreted using the same
letter of the FBI because it happens to be repeated a second time.
So the number of letters from the beginning of the first LW M to the beginning of second LW M, which
we call it as a spacing is thirteen.
Now this suggests that the key used for this ciphertext is 13 letters long.
By just looking at the repeated sequences, you can find out the letter of the key or the length of
the piece.
However, in most ciphertext, the key vaunt conveniently align with the repeated sequence of letters,
or the key might repeat more than once between repeated sequences, meaning that number of letters between
the repeated letters would be equal to multiply of the key rather than the key itself.
So to try to address these problems, we will look at a longer example, which we don't know what the
key is.
So let us take a particular example in this case.
Now, let us write down it over here.
Let's take it c, p, p, q, c, a let's give it a space here.
C, x, u, we k, g, c for moment of giving us this letter simply continued writing this letter to
provide me in a game that you see my B and G, B and C, G and I need to make it all in the same sequence.
Then let's continue C.
S or D is that G.
Why I am then a full stop then let's take we are a G again.
Let's put it in one then C, V or h.t..
We are a u c t is G again a full stop.
Let's align it properly, c, d, d, w, you know, let's take x, i, d.
Then A said you it would be a little much bigger so that we're able for easy for us to understand that,
say we a we we are a z, c, v, v, q, p i, w v all you.
So we have a line this properly.
Now, if you just look at it over here, see this vibe in here, let's highlight this and this is why
we in here are pretty similarly this if you look at it, OK?
Have you made your mistake?
Yes.
After YV and we had missed all this here.
So now this is a do you and similarly, if you look just ahead after a while, you have your also.
Is it.
Now let us give this a different heading.
So the story repeating here.
Similarly, if you just look at another that is severe a similarly we are here and again, we are here.
Even these three words are also repeated.
So this many votes we are having repeating, which we have identified.
So there are several potential villains over here.
Now, the next step of your kazatsky examination will be to calculate all the factors of these count,
to narrow down the potential Keelen.
So not moving to getting the factor of spacing's.
Now, the spacing between the sequences, if you just not on it, you are having three eight eight,
then twenty four, thirty to forty eight.
Now the factor of the spacing are more important than this spacing actually.
So to see.
Right.
We'll just look at the message, for example, see if we take another one.
See the dog.
And the.
At.