18.1. Key Agreement and Secure Communication

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 discusses the assumption that a key agreement has already taken place among the parties involved in secure communication. Key agreement refers to the process by which two or more parties establish a shared secret key that can be used for encrypted communication. In this case, Sita and Ram have successfully completed this protocol and are now ready to communicate securely using that established key.

Imagine two friends wanting to share secrets via notes. First, they create a special code (the key) that only they understand. Once they have this code (the key), they can safely write messages to each other without fear of anyone else understanding them.

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 have established a common key, they need algorithms for encrypting and decrypting messages. Sita will use an encryption algorithm to transform her plain message into ciphertext (garbled text), making it unreadable for anyone who intercepts it. Ram, on the other hand, will use a decryption algorithm to convert that ciphertext back into the original message using the same key. This ensures that their communication remains confidential.

Think of Sita writing her messages using a special language only she and Ram understand. If someone else finds her message, it looks like a jumble of random letters or numbers, making it impossible for anyone else to comprehend.

So that is the second problem addressed by cryptography. 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 m1, m2, m3 and so on.

Secure communication ensures that even if a third party (like Ravana) knows the details of the communication process, they cannot decipher the actual messages without the shared key. This is crucial for maintaining confidentiality, and it’s what makes the communication process robust against eavesdropping.

Imagine mailing a letter sealed in an envelope. Anyone can know that a letter is being sent and even know who it's from and who it's to, but only the person with the correct key to open the envelope (the correct key) can read the contents of the letter.

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

This chunk introduces symmetric key encryption, which is one of the two main classes of cryptographic algorithms. In symmetric key encryption, both parties use the same key for both encryption and decryption. This means that the secure key must be shared among Sita and Ram, ensuring that no one else knows it.

Imagine Sita and Ram each have a copy of a special key that opens a locked box. They both use this same key to lock and unlock messages they want to send or receive. If someone else wants to understand the messages, they need the same key, which they don't have.

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. Now she can send this locked box by a courier or anything. So, if there is a third person who does not have the key for opening the lock of the box, he would not be able to do that.

The analogy compares the encryption process to a physical lock and key system. Sita can lock her message in a box, and only Ram has the key to open the box and read the message inside. This reinforces the idea of symmetric key encryption, where the key is crucial for both securing and accessing the information.

If you wanted to send a private letter to a friend, you might put it inside a locked diary. You give your friend the key (the encryption key) so that only they can open it and read what you've written. Anyone who finds the diary without the key will not be able to open it.

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?

This chunk highlights an important challenge in secure communication: how to establish a secret key over a public channel. It emphasizes that Sita and Ram need a way to agree upon a key securely, especially when their initial communication happens over an open medium, where third parties could intercept their messages.

Consider ordering something online. You need to share your credit card information to make a purchase. But how do you ensure that the payment information remains secret from anyone who might be listening in?

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 was groundbreaking because it demonstrated a method for two parties to agree on a shared secret key over a public channel. This method overcomes the challenge mentioned earlier and allows Sita and Ram to securely establish a common key even when communicating openly.

Think of it like two friends exchanging secret ingredients to bake a cake. They can't predict how their ingredients will be combined, but through a clever way of writing down and sharing their components, they end up with the exact recipe that only they can recreate.

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 explains the concept of asymmetry in computational tasks, which is foundational to the Diffie-Hellman protocol. Certain operations are easy to perform in one direction but challenging to reverse. The protocol takes advantage of this property, allowing Sita and Ram to create a shared key without disclosing their individual secrets to an eavesdropper.

Consider squeezing an orange juice. It's easy to squeeze the juice out (the easy computation), but it's nearly impossible to get the exact whole oranges back from the juice (the difficult reverse). This analogy shows that while it's easy to do one action, reversing it could be much more complex.

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. So, Sita will prepare her secret mixture independently and Ram will be preparing his secret mixture independently, by adding a secret color, individually and then they will publicly exchange their mixtures.

In this part of the Diffie-Hellman protocol, Sita and Ram each independently select a unique secret value (akin to secret mixtures) and exchange public versions of these secrets. The idea is that even if someone intercepts these public exchanges, they cannot discover the original secret values without additional information.

Think of two friends deciding to create a special drink. Each friend chooses a fruit (a secret component) and then they mix them with a common base (the public mixture) in a visible glass but they never reveal which fruits they picked. This way, no one can guess the final color of the drink (the common mixture) just by seeing the color.

Now, what is the goal? The goal for Sita and Ram is to come up or agree upon a common mixture which should be known only to them. So, what they can do is, they can individually add the secret component that they have added, to the copy of the mixture that they are receiving from the other party.

In this phase, Sita and Ram combine their independently prepared secret components with the public mixtures they received from each other. This final combination results in a common mixture (shared key) that only they know, and an outside observer cannot decipher, thereby establishing a mutual key for secure communication.

Returning to our drink analogy, after mixing their beverages together with the common base, when they each taste it, they realize they have created a unique flavor (the shared key) that can only be replicated if they both know which fruits were used initially.

For the adversary or for the third person to compute ⟨k1⋅k2⟩, he should know α or k2. Because if any of these 2 values is learned by the attacker, he can easily compute ⟨k1⋅k2⟩. But for learning α or k2 he has to basically solve discrete log. That means, if I ensure that computing discrete log is extremely time consuming for this attacker and by time consuming means, at least it takes say 10 years or 15 years then, I can say that this protocol is safe.

This chunk discusses the security aspect of the Diffie-Hellman protocol, focusing on the difficulty of solving the discrete logarithm problem. If an eavesdropper cannot feasibly compute the original values based on the public shared data due to the time it would take (many years), then Sita and Ram’s exchanged key remains secure, protecting their communication.

Imagine a really tough puzzle that takes many years to solve. Even if someone has all the pieces (the public data), without knowing the original hidden secrets (the key), they can't put together the picture (the common key) that would make them understand the conversation.

So, it turns out that, if we instantiate this protocol with my group being ℤ that means, if I ensure that my group G is the set ℤ where, p is some 2048 bit prime number then, using current best computing speed machines for solving a random instance of discrete log, it will take order of several years.

Here, the text explains the specifications needed to make the Diffie-Hellman protocol secure. By using a large prime number and ensuring the group used is suitable for secure calculations, the difficulty of breaking it through brute force becomes impractical. This assures Sita and Ram that their communications remain protected.

Think of using a locking mechanism that can only be opened by a key that's been specially engineered to be extraordinarily complex, so even the best locksmiths (attackers) would struggle for years before they could open it.

So, now you might be wondering that what should be the choice of the group, how big it should be and so on. So, it turns out that, if we instantiate this protocol with my group being ℤ that means, if I ensure that my group G is the set ℤ where, p is some 2048 bit prime number then, using current best computing speed machines for solving a random instance of discrete log, it will take order of several years and hence, an adversary who tries to attack the scheme will fail to do that.

This concluding part of the section reinforces the choice of parameters crucial for the Diffie-Hellman key exchange protocol. By ensuring the mathematical hardness of the underlying discrete logarithm problem, the protocol remains secure against plausible attacks, thus enabling solid practical implementations in secure communications.

It’s like choosing a safeguard for a vault. The thicker and more complex the walls and lock combinations are, the more protected your valuables are from anyone trying to break in.

--