Now, the next function, which you have to find here is get the end Saki's a letter in which you are
passing three parameters Faustus and then the Guillem and the message.
Now this returns every end the letter for each set of letters in the text.
For example, if you pass one commentary and the ABC, ABC, ABC would return 80 or if you pass on it
ends up this letter in package you pass to Komati again.
ABC, NBC, ABC would return BBB.
Similarly, if you say trigonometry, ABC, ABC, ABC will return the value of C.C.C. or if you see
one Gomo five.
The value of a b c d e f g h.
I get the value of and if that is the first and the fifth now using a regular expression to move the
normal letters from the message we are seeing, your message is equal to not let those underscore 14.
sub black gamma message.
Then, after which we are seeing that I is equal to and minus one letter that still is blank.
And while I use less than the length of messager pending the value in letters still incrementing I plus's
equal to the KB and returning the value of Lakotah still using join.
Then we try to define another method that is attempt haak with the Guyland and which we are passing
ciphertext and most likely kilim.
Now here we are able to determine the most likely letters for each letter in the key.
Hence we are saying ciphertext up is equal to ciphertext upper and then all the frequency, of course,
is a list of most likely killens number of list.
So these in our list are the frequency Schauder list.
Hence we are saying all frequencies cause equal to black and four and in the range of one till the most
likely guyland plus one.
Use it and all it does is equal to call your get and subcu let us pass and most likely Guyland and the
cipher text up.
Then you have the frequency schools in the list of pupils like letters comma Ingomar Frequency column
or automats or something like that.
So this list is sorted by my score.
Higher score means better match.
So you can see the method that is English frequency math score and you can understand what I was trying
to do there.
So in this particular for loop, we are first creating a blank frequency scores, then saying for possible
in letters calling your decrypted text is equal to from Virginia for the more we call the decrypt message,
more function in which now here we have the decrypt message SDR function in which we are passing the
possible keys and the end letters there.
Then we have key frequency match from which we are seeing frequency analysis in which from which we
are calling the English frequency math score.
Now if we just open up the frequency analysis.
And we just checked the matter that we have this English frequency med school.
Similarly, if we just open the Virginia site for demo.
And the message we have is decrypted message, estie, are so the same thing we pass here, and then
in this we are passing the decrypted text, which we have created.
Then we are seeing frequencies also dot up upend and we are trying to pass their vickki and on frequency
match tuple.
And then we try to sort by them at school by saying frequency scores dot sort.
He is given Andrewartha to draw and all frequency schools start up and the value of frequencies goes
numb.
Most frequency letters then we are checking, if not the silent underscore Monastir then for I in the
range of length of all four frequencies cause we are using it plus one.
The first letter is not called the or zero the letter.
Hence we are saying here I plus one in this case using the print.
Then we say for the frequencies code in all the frequencies code words at the index of I will print
the value of frequencies, go to the index zero and put in the new line this.
Then we try every combination of the most likely letters for each position in the key, using this for
loop, seeing for indexes in the total dot products in the bracket range of normal frequency letters
and repeat equal to most likely hellenthal.
Then we create a possibility from the letters of all frequencies close by, just saying possible equal
to blank and for I in the range of the given most likely killed you increment possible equals two possible
plus all the frequencies of the index of zero.
Then we check if it is not in the silent Monastir we are printing, attempting to give it and the value
of possibilities.
Then from the decrypted text again, here we are sense of beginning as I for demo in which we are calling
decrypt message and the name of the function is decrypt message.
Start are bypassing the possibility and the ciphertext reject now is in the English file.
If you just try to open your having the method as it is English check.
So we use the same method, name and password.
But Amaterasu decrypted text.
Then we said we have to ciphertext to the original keesing by saying your original case is black.
And for I in the range of length ciphertext converted to opponent appended to your decrypted text is
converted to lower end of Joinet using the decrypted text.
Then we are printing it over here that the possible encryption hack with the key is OK.
If it is found, then reject the user to see if the key has been found.
Then we print the first two hundred characters that print the blank line and as the input from the user,
then, depending on the user's input, we are returning the value of decrypted text.
If no English looking decryption was found, we are returning this none over here.
The next thing we are having here is the define hack.
Virginia functions now in this particular function.
The first thing we are doing is we need to do the examination to figure out what the length of ciphertext
encryption is, hence we are seeing all likely Killens is equal to the Kosaka examination function and
in bracket passing ciphertext then, which is not the silent mode, we create a blank ealand a steer,
and for the guyland in all likelihood Elance, we are incrementing the value of Guyland Ista and printing
because aski examination results are the most likely killens out on the value of killens.
Then we create a messages and for the Guillain in all likelihood Elance we are checking first if it
is not in the silent mode and then printing off message here after we print the message we say hacked
message is equal to the ATM tag with Glemp print the value of giving the ciphertext and checking if
it is not equal to break it, or if none of the killens found using the examination, then start the
brute forcing through the killer's hands.
Then we are saying over here that if that message is equal to none and if not a silent Monastir, print
the message and continue for Guyland in the range of one to the masculine plus one.
Don't reject any.
Killens already tried from kazatsky.
So then we are checking here that if it is not in all the likely Egeland's and not in the silent mode,
print the message and put the values of our time.
Tag with Guyland in the hacked message is still after which we are checking again.
If it is not not, we break it and finally return the value of hacked messages to the calling program.
Then we just check.
If Virginia hacker them over here is run by itself, then we are going to call the main method here.
Otherwise call the main method from outside.
Now, this particular example that we have done, we will see the execution and understand how in detail
how this particular function or the particular file is working in the next session.
So that's it from this session.
Thank you very much.