18.3.2. Asymmetric Tasks

And assuming that the key agreement has been achieved, the second problem that is addressed by the cryptography, the second core problem, I should stress here, it is not the case that secure communication is the only problem, the second core problem addressed by cryptography startup secure communication. So, the setting here is the following, we will assume that Sita and Ram has already executed the key agreement protocol over the internet, and they have agreed upon a common key.

This chunk introduces the concept of secure communication after a key agreement has been established. Sita and Ram have successfully created a common key through a key agreement protocol. The mention of key agreement emphasizes its crucial role in establishing a secure line of communication, allowing both parties to encrypt and decrypt messages between them.

Imagine having a secret handshake with a friend. Once you've established that handshake as a way to recognize each other, you can privately communicate without anyone else understanding. The key agreement is like that secret handshake.

And now using this common key, we would require Sita and Ram to come, we would require some algorithms which are publicly known, according to which Sita can convert or encrypt her message into some garbled text into some garbage and communicate to Ram and Ram should be able to convert back those garbage or scrambled text back to the original contents using the same key.

This chunk discusses how Sita will use a public algorithm with the common key to encrypt her message, transforming it into a seemingly meaningless format called ciphertext. The receiver, Ram, will then use the same key to decrypt this ciphertext back into the original message. Encryption protects the content from eavesdroppers who may be monitoring the communication.

Think of a locked box where Sita places her message. She locks the box (encrypts) with a key that both she and Ram possess. Only Ram can unlock the box (decrypt) and read the message.

So, it turns out that there are two kinds of, two classes of cryptographic algorithms which we use. The first category is that of private key or symmetric key encryption. In the symmetric key encryption, the setting is the following...

This chunk introduces symmetric key encryption, where both Sita and Ram use the same key for both encryption and decryption. This symmetry is how the method gets its name. It emphasizes that the security of this method relies on the secrecy of the key that only Sita and Ram know, providing a clean and straightforward way for secure communication.

Using the same locked box analogy, if both Sita and Ram have the same key to the box, they can send messages back and forth securely. However, if someone else got hold of that key, they could also access the locked box.

So, it was a folklore belief that it is not possible to agree upon a common key by interacting over a public channel. But the Turing Award winner, Diffie and Hellman, proved this belief to be incorrect...

Here, it discusses the breakthrough by Diffie and Hellman in key exchange methods. They demonstrated that it is possible to securely agree on a common key through public channels, highlighting the existence of asymmetric tasks. These tasks are easy to perform in one direction but difficult to revert, which underpins the security of the key exchange process.

Imagine a situation where you can easily lock a door without the key, but to unlock it, you would need the key. This represents asymmetry, making it hard for outsiders to gain access without the proper 'key', just as it is difficult for an eavesdropper to find out the key used by Sita and Ram.

So, based on this idea that asymmetry is there in lots of tasks. This is the underlying idea of Diffie Hellman key exchange protocol...

This chunk explains the specifics of the Diffie-Hellman key exchange protocol. Both Sita and Ram independently create secret mixtures and exchange them publicly, which ensures that even if an outsider intercepts these mixtures, they cannot derive the final common key without the original secret components.

It's like two artists mixing paint—each starts with their special colors, mixes in a bit of blue (publicly shared), and ends up with a unique shade that neither can fully replicate without knowing each other's original colors.

--