18.2.2. Analogy of the Lock Box

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 key agreement as a prerequisite for secure communication. In our example, two characters, Sita and Ram, have successfully established a shared secret key using an initial protocol. This shared key is essential because it ensures that both parties can communicate securely without others being able to intercept their messages.

Think of Sita and Ram agreeing on a secret handshake that only they know. This handshake allows them to recognize each other in a crowded room and share messages privately, just as the shared key helps them secure their communication.

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, k which Sita has.

Once Sita and Ram agree on a common key, they need a method to encrypt and decrypt their messages securely. Sita will use an encryption algorithm to transform her message into a 'garbled' or scrambled text. This encrypted message can safely be sent to Ram, who can then use a corresponding decryption algorithm and the same key to convert it back into its original form. The key is that while the algorithms are known publicly, the key itself remains confidential to both Sita and Ram.

Imagine Sita writes a letter containing a secret message, but instead of sending it directly, she puts it in a locked box (represented by the common key). This box is sent to Ram. As he has the same key, he can easily unlock the box and read the original letter, while anyone else who sees the box cannot open it.

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. It will be ensured that a common key is already shared between Sita and Ram by some mechanism, say, by running a key agreement protocol and no one else apart from Sita and Ram knows the value of that key.

Symmetric key encryption is an essential component of secure communications. In this method, the same key is used for both encryption and decryption. For Sita and Ram, this means that after they have established their shared secret key, they can secure their messages using this method. The major advantage here is the simplicity and speed of symmetric encryption processes.

Consider a scenario where Sita and Ram each have a unique key that fits a specific lock. They can both lock and unlock the box containing messages with the same key, ensuring that only they can access the contents.

So, the analogy could be that, assume Sita and Ram have already exchanged a key for a physical lock. If Sita has a message, what she can do is, she can take a box, keep her message written in a paper inside the box and close the box with a lock and using the key that she has. And now she can send this lock box by a courier or anything.

This analogy illustrates how secure communication works. Here, Sita places her message inside a locked box and sends it to Ram. The locked box represents the encrypted message, and since only Sita and Ram possess the key, no one else can access the message. The use of a lock ensures that private communications remain confidential.

Imagine sending a valuable item using a securely locked box. Even though the box may be mailed through a busy postal service, only the intended recipient can unlock it. Just like a letter sent by Sita can only be understood by Ram with the matching key.

Now, 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.

One challenge in secure communications is establishing a shared secret key via a public channel. It's critical for Sita and Ram to find a way to share their secret without someone eavesdropping and learning the key. This discussion introduces the issue of key agreement and highlights the complexities involved in establishing a secure connection.

Think of arranging a secret meeting in a crowded place without anyone overhearing. You can't just announce the time and place; you need to find a secure way to communicate such sensitive information.

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.

The introduction of the Diffie-Hellman key exchange method revolutionized how secret keys can be securely agreed upon, even when communicating over public channels. This protocol allows Sita and Ram to create a shared key through mathematical procedures that make it nearly impossible for an eavesdropper to deduce it.

Imagine a special technique invented by Sita and Ram that allows them to agree on a safe meeting location without revealing it to anyone else. This way, they can maintain their privacy while ensuring they can still meet.

--