So we're doing permutation and what we are actually doing is mixing out the bits. And from the first permutation each cipher algorithm is doing sets of operations and repeats them in several rounds. What kind of operation, throwing away some bits, doing another set of permutation, rearranging the bits, splitting the key into two halfs. swapping the half's shifting the bits left and right. And then we do another round, another permutation splitting the keys and swapping them. cipher algorithms are doing dozens of such rounds to get the perfect secret key.

So that's four key. And what about the plaintext that we want to encrypt? That is also being primitive using a permutation table. So if for example, we have a plaintext, or a bitstream of 10101010. And our permutation table turns the output into 01010101. We take the plaintext and we split it into two halves.

Now let's take a look at one half. We do what is called an expand and permitted that is each bit is being duplicated and arranged differently. So if we have 1010 we do Located and rearrange it. And now let's take our key and store it with the premeditation of the plain text. And the result is the cipher text. Now, that was a simplification of the process.

There are multiple rounds of operations and each cipher algorithm works in a different way. But the idea is the same idea. You're taking the bits, you swap them, you shift them, you substitute them with the key, and you generate a cipher text.