18.3.1. Folklore Belief and Key Exchange Protocol

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

This chunk introduces the concept of secure communication by first stating that Sita and Ram have already established a shared key. It emphasizes that cryptography deals with two core problems, one of which is enabling secure communication. The idea is to transform messages into a format that cannot be easily understood by unauthorized parties. Sita encrypts her original message into an unreadable format (ciphertext) using a publicly known algorithm, and only Ram, who possesses the common key, is able to decrypt it back to its original form.

Think of Sita writing a secret message in a hidden language that only Ram understands. Anyone else who intercepts the message will see gibberish and won't know its original meaning unless they have the key to decode 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. Now, if that is the case assuming this setup has been done, 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 net banking password. So, she has some message which is abstracted as a binary string, we call her message as plain text.

This chunk explains symmetric key encryption as a type of cryptographic algorithm wherein Sita and Ram share a common secret key, ensuring that only they can understand the encrypted messages. It emphasizes that before sending any message, Sita's original message (plain text) is converted into an encrypted format using a symmetric encryption algorithm, which is invisible to anyone who does not possess the key.

Imagine Sita and Ram have a special box that they can lock with the same key. Sita places her note inside the box and locks it. When Ram receives the box, he unlocks it with the same key to read Sita's note.

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 secure key with Amazon? And that too, by communicating over the internet, so that is a big question. How at the first-place key agreement has taken place?

This chunk raises a critical point: how can Sita and Ram safely agree on a common key when they are communicating over an open public channel? It introduces the problem of key agreement, which is crucial for any secure communication setup. They need a method to establish this key without someone else being able to intercept and use it.

Imagine trying to establish a secret handshake with someone you've just met in a crowded room. You need to create and agree upon the handshake without letting anyone else see or hear it, so it's kept private.

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. So, I would not be going into the full details of security proof and other details of the key exchange protocol, I will just try to give you the underlying idea.

This chunk introduces the pivotal role of Diffie and Hellman, who developed a groundbreaking key exchange protocol that allows two parties to securely agree on a common key despite communicating over a public channel. This fundamentally shifts the belief that such key agreements could not be achieved securely.

Think of it like two spies in a busy cafe, who need to agree on a secret code. They devise a way to convey parts of the code to each other without anyone else catching on, ensuring that they both end up with the same code.

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 operations, where some tasks are straightforward to execute in one direction but exceedingly hard to reverse. This characteristic is foundational to the security of the Diffie-Hellman protocol and similar cryptographic methods.

Imagine a one-way street where it’s easy to drive down but you can’t easily backtrack. In cryptography, some operations can transform information easily, but retrieving the original information without specific knowledge (the key) is nearly impossible.

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.

This chunk outlines the steps of the key exchange protocol, where both Sita and Ram start with a publicly known starting point (color) and independently generate their secret mixtures. They then exchange their mixtures without revealing any secret components.

It's like two chefs who start with a common recipe but each adds their own secret spice. After cooking, they swap dishes to create a unique final dish that reflects their individual touches.

--