18.5. Conclusion

And assuming that the key agreement has been achieved, the second problem that is addressed by 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 key agreement in cryptography. It states that once two parties, Sita and Ram, have established a common key using a key agreement protocol, they can proceed to secure their communication. The text emphasizes that achieving a common key is only part of cryptography's broader goals, which include enabling secure communication.

Imagine two friends deciding to share secrets. They first agree on a secret phrase that no one else knows. This agreement is like the key agreement protocol. After they have this phrase, they can exchange secrets without others being able to decode them.

So, namely we want to come up with algorithms which should help me to do secure communication. And by secure communication here I mean that, if there is a third party or Ravana, who knows the public description of your algorithm but does not know the value of key then even after observing the communication happening between Sita and Ram and even after knowing the full protocol description according to which these messages have been computed, the Ravana should not be able to come up with the values of m, m, m and so on.

This chunk delves into the concept of symmetric key encryption, which is a type of cryptographic algorithm where the same key is used for both encrypting and decrypting messages. The goal is to ensure that even if an outside observer (Ravana) knows the algorithms used, they cannot decipher the actual messages if they do not have the key.

Think of a locked diary where the same key is used to lock and unlock it. Anyone can see the diary but can't read the contents unless they have the key. This prevents unauthorized access, just like symmetric encryption prevents unauthorized users from understanding the messages exchanged between Sita and Ram.

Now, the way symmetric encryption works is as follows. So, imagine Sita has some message, it could be an email, it could be just a hi message, it could be anything, it could be her banking password. So, she has some message which is abstracted as a binary string, we call her message as plain text. We want to design an algorithm which we call as an encryption algorithm which takes a message m and the key k both of which are binary strings. And it should produce another binary string which we call a ciphertext.

In symmetric encryption, when Sita has a message (plain text) she wants to send to Ram, it is turned into a scrambled form called ciphertext using an encryption algorithm. This transformation uses the common key they agreed upon. The ciphertext looks like gibberish to anyone who intercepts it, ensuring the message remains confidential.

Consider sending a secret coded message. Before sending it, you encode it into a complex system of letters and numbers. To anyone else, it appears meaningless. Only the intended receiver, knowing the encoding method and the original 'key', can decode it and understand the message.

Now, once Ram obtains this scrambled message, he will have a decryption algorithm, he will have in a sense, he will know that Sita has used an encryption algorithm whose details are publicly known and the corresponding matching decryption algorithm also will be publicly known. So, Ram will use the corresponding decryption algorithm.

After Sita sends the encrypted message (ciphertext) to Ram, he uses a decryption algorithm to convert it back into the original message (plain text). This decryption relies on the same key that Sita used for encryption, highlighting the symmetric nature of the process.

If Sita sends Ram a locked box (ciphertext), Ram uses the same key to unlock it and see the content inside (plain text). The decryption process is like knowing how to open that box using the key they both already possess.

So, how at the first place they can do that? Because everything will be now happening over a public channel because it is not the case that Sita and Ram knew beforehand in advance. It is like saying the following, if I want to do a transaction over the internet; Amazon may not be knowing well in advance that a person called Ashish Chowdhury, would like to do a transaction with Amazon. So, I will be doing my transaction at a run time, how at the first place key agreement has taken place?

The text raises a pertinent question about how Sita and Ram can establish a common key securely when communicating over a public channel where eavesdroppers could be present. This introduces the challenge of key agreement, which is necessary before they can use symmetric encryption.

It’s like wanting to send a secret message over an open street where anyone can hear. To ensure safety, Sita and Ram need to create a private setup beforehand, like whispering the secret agreement in a secluded place before they start exchanging messages in public.

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, by coming up with their seminal key exchange protocol.

This chunk introduces the Diffie-Hellman key exchange protocol, which demonstrates that it is indeed possible to agree on a common key over a public channel without prior arrangements. This revolutionary method relies on the mathematical properties of certain operations, creating a method for secure key exchange.

Imagine two friends who use a complicated recipe to create a shared dish in a public park, where others can observe them preparing it. Despite onlookers being able to see the process, they still end up with a unique dish that only they can enjoy, thanks to their special ingredients, which are like their secret additions to the recipe.

So, the main idea used in their key exchange protocol is the following. They observed that there are plenty of tasks in this universe which are asymmetric, they are asymmetric in the sense, they are very easy to compute in one direction. That means, it is very easy to go from one state to another state but extremely difficult to reverse back the effect of that action.

This chunk discusses the concept of asymmetry in cryptographic tasks, where certain operations are easy to perform in one direction but hard to do in reverse. This property allows Sita and Ram to securely exchange keys over a public channel without revealing their secret keys to an observer.

Think of wrapping a gift. It’s easy to wrap it (the first direction), but unwrapping it without tearing the paper is much harder (the reverse direction). In a similar manner, certain cryptographic functions are easy to compute forward but nearly impossible to unravel without the right key.

So, to begin with, both Sita and Ram will be starting with some common publicly known color. And now, what they will be doing is the following. They will prepare independently some secret mixtures.

This chunk outlines how Sita and Ram start their key exchange by using a common public reference point and then create their own private elements (secret mixtures). After sharing their public mixtures, they each add their secret parts to the other's mixture to derive a common secret.

Imagine two chefs who each have their own secret ingredient. They start with a base recipe everyone knows, mix their secret ingredients into separate portions, and then combine their creations to make a unique dish that only they know how to make.

So, whatever Ram’s mixture that Sita has received, she takes that and to that she adds whatever components she has added to prepare her secret mixture. And same task is done by Ram. He takes Sita’s mixture and to that he will add his own contribution.

In this part of the protocol, Sita and Ram combine their mixtures after adding their respective secret ingredients. This ensures they both arrive at the same final mixture, which becomes their shared secret key.

It's like baking a cake with a unique flavor. Each chef adds their unique flavors into a bowl, and regardless of the order, they end with the same cake (the key) that only they know how to make.

So now you can see that how exactly the concept that we have seen in the context of cyclic groups are useful to come up with a very important practical solution for a practical problem namely that of key agreement.

The conclusion emphasizes that the mathematical concepts, including cyclic groups used in the Diffie-Hellman protocol, provide practical methods for achieving secure key agreements. This highlights the importance of theory in developing real-world cryptographic solutions.

Think of building a secure bridge based on sound engineering principles. The mathematical concepts behind key agreements are like the blueprints and structures that make sure the bridge is safe for daily use.

--