So let us come to new.
We would go for a for loop, see, creating a symbol in my cities and in this for loop we will check
if the symbol in.
Symbolistic, then we are decrypting the symbol, so we are seeing your symbol if X is equal, to use
your symbol star Daudi find the metaphor and symbol in that, then you take the plain text.
SDR plus is equal to, say, Symbolistic.
In squid wreckage around wreckage, the symbol is X minus the V one multiplied by the mod of.
Inverse of the Avon.
That model of land of.
Symbolistic.
Close that, then we write down here the fact that if this is not true, then we take the plaintext
stuff as equal to.
Symbol.
And finally, we use a written statement.
And work the value of plaintext still.
Now that is the end of our decrypt messages.
Now here we are defining another matter that is a good.
Random ATSDR, and in this matter, we are running a vital, vital piece through the U.S. Capitol.
And while this is true, we are saying everyone is equal.
We are generating random thought, run into metal, passing the two and the length of symbolistic.
This is one, then four GB one.
Again, we are seeing random dot run and again passing through and the length of.
Symbolistic, then we check if.
Krypto.
One dot our GCD matter here, we are passing a one in that and the length of SYMBOLISTIC, if that's
equal to one, then we are saying we get one multiplied by line of.
Symbolist.
And plus, he Beevor, so after this, we are using this if condition and the Cryptome at one function
in that we are passing the Evenki and the length of the SYMBOLISTIC, if that comes to equal to one,
then determining the value of even multiplied by the length of this year and the value of Beevor.
Now, once we have completed this, we will check to see if underscore Niemöller score is equal to see
in single code on the score mean and then you want to call me.
Now let's see if this program and let's give you meaningful name for this.
I see a fine Saiful, something like that.
So we will see which here a fine.
Saiful.
Let's give a fine sign for them.
Dr. By.
And let us save this and now let us try and run the module, so we're getting this encrypted text and
full encrypted text.
So now, for example, if we.
Copied on this particular text, go to overprogrammed back here and if we put that text over here.
Let's select this and based it here and now we will give your description.
Then let us save it and again, try to run this.
So now it has been decrypted same the same as it does so.
We have seen encryption process also and the decryption process also.
Right.
So now let us understand that the program that we have written.
So let's come back here and go to the first line that there is where we are basically setting up the
modules, the constants and the main function.
So here we are, first of all, giving the four modules, which we have important in this session.
That is basically the SIS module four is important.
Basically, we have used the exact function don't exist, hence we have imported that module.
It is important for the core pickleball function that we are using then the crypto math.
One module that we have created in the U.S. is important because we are using the function also defined
more inverse function from that particular module.
Similarly, the random module that is important for for the random doctorand and function to generate
some random piece.
So the string stored in the symbols is still variable, is a symbol that we can see, which is basically
a list of all the characters that can be encrypted.
So here we have given all the characters and capital in small case, also numbers.
So any characters in the message that don't appear in this remains unencrypted in the ciphertext.
For example, if you run the particular example, you can see that we have this dush that is remaining
unencrypted because that is not what we have given here.
So that don't get encrypted into ciphertext because they don't belong to your symbols that you have
defined, then we are defining the main function, which is almost exactly the same as the one we have
in the transposition cipher program.
Right.
So it basically it's totally message is still then your idea and your Monastir variables respectively.
Right.
Then the value stored in your mind.
Modesta is either set to include.
So we are checking that over here, whether the program encrypts or decrypt the message.
So if my mood is said to encrypt the execute and return value of the encrypt messages and it is stored
in the trust that it is still variable, but if my estimate is set to decrypt, then we call the decrypt
method to Starmaker and the return value is stored again and translated Estienne.
Now this encrypt messages and decrypt messages are functions.
We would understand that somewhere later in the session.
Now, after the execution of this line, we come over here when we are having the translated variable
that has the encrypted or the decrypted version of the message in my messages.
So we are using some ciphertext, using the percentage as placeholders that basically tells the user
whether the output is encrypted or decrypted.
So after this, we are having some print statements which put in some string in the transmitter last
year, which is encrypted or encrypted version of the string in my messages.
And again, after that, we are hoping that by using the clip and later notifies the user that it is
copied on the clip.
Now, after this, we come to calculating and validating the keys, not unlike the cipher, which uses
addition with only one he finds.
Saiful uses multiplication and addition to Empedocles, which we will call it, say, for example,
A1 and every one, because it is easier to remember just one number.
We'll use a mathematical trick to convert to keys into one.
So now let us look at that when we are converting one or one number in to this.
So you'll we come to the method that is get Keyport SDR, which splits a single integer into two individuals
for P1 and Beevor.
So the key split is fast to the key parameter.
The key one is calculated by using an integer division to divide the key by line of symbol Asgeir and
the size of this Envisat, then the integer division that this double slash latency quotient with all
the remainder.
So the operator calculates the remainder, which will be used for E V1.
So for example, suppose we are having C here.
Yes, two eight nine four.
Then the key parameter and the symbolistic a string of six to six characters, the A1 would be saved.
I just write down here EVA will be equal to do it nine four, six to six which will come to say for.
Three and your key one would be two eight nine four modulars sixty six, which will be 56 now to combined
A1 and V1 back into a single, if you will, multiply even by the size of the set and keep one to the
product.
That is, we would see, for example, see in bracket forty three multiplied by sixty six plus.
Fifty six, which will come to, again, two eight nine four, which is the integer key we started with.
So now let us move on to the tuple data.
So let's just put this particular part in the comment.
So which will not be executed as such?
It is just there in your particular program, which will help you understand what we're trying to do
in the above given two parts.
So once we have done this, now we move on to the next code where we are basically returning the list
values except the parentheses are used instead of the square brackets.
Now, this is basically called as your pupil value or tuple values, similar to a list value in that
it can store all the values which can be accessed with indexes or slices.
However, unlike list values, tuple values cannot be modified.
So there is no appen method for your approvals now because this particular program doesn't need to modify
the value written by the gatekeeper method.
Using a pupil is more appropriate than the list.
Now the next thing is we check for the wikis over here encrypting with the afine.
Saiful involves a characters index in the symbols that are being multiplied by one and then added to
Avivah.
But if each one is one, the encrypted text is very weak because multiplying the index by one results
in the same index.
So in fact, as defined by the multiplicative identity properties, the product of any number is one
is that number.
So similarly, if one is zero, the encrypted text is weak because adding zero to the index doesn't
change it.
If a one is one and we want to zero at the same time, the encrypted output would be identical to the
original message.
So in other words, it won't be encrypted at all.
So we check this wikis using this check the SDR function and the statement or the IF statement.
And this particular function checks whether the key A1 is one or B one is zero, which is overkill.
So we check if each one is one or B, one is one and the more studies.
And so if these conditions are met, the program exit with a message indicating that what went wrong.
So below those lines we are using or we are passing a string to store exit function and sister exit
function has an optional parameter that lets you put in the string to the screen before terminating
the program so you can use this function or display an error message on the screen before the program
quits.
Now, check all this.
Checks prevent you from encrypting with Vickie's, but if your more is set to decrypt, then the check
comes, which we have checked below.
You'll notice on this line now here the condition checks whether each one is a negative number or B
one is greater than zero or less than the size of the sample, said minus one.
So now the reasons the key are in this range is described in the coming session.
If any of these conditions as to the keys are invalid and the program also exits additionally even must
be relatively prime to the symbols size.
So this means that the greatest common deviser or the of A1 and the length of symbolist are must be
equal to one.
So this we are basically checking over here in this condition, which is basically checking that if
this statement, the program is the two values are not relatively bright.
So if all the given conditions in your checky SDR functions written for us, nothing is wrong with the
keys and the program doesn't exist.
Program Execution's returns to the line that originally called the Chiqui Asgeir Method in our MI.