A TLS 1.2 cipher suite (e.g., `TLS_ECDHE_RSA_WITH_AES_256_GCM_SHA384`) is composed of four distinct components, each serving a specific cryptographic purpose in the "handshake" and subsequent secure tunnel:

• 1. Key Exchange (ECDHE):The mechanism used to establish a shared secret session key between two parties who have no prior knowledge of each other.
• 2. Authentication (RSA/ECDSA):The method used to verify that the server is who it claims to be, typically using digital certificates and asymmetric math.
• 3. Bulk Encryption (AES-GCM):The symmetric algorithm that encrypts the actual data flow. Symmetric encryption is computationally cheaper than asymmetric methods.
• 4. Integrity (SHA384):The Message Authentication Code (MAC) or hash used to verify that packets haven't been tampered with in transit.

Interestingly, in **TLS 1.3**, the syntax has been simplified to focus almost exclusively on bulk encryption and hashing (e.g., `TLS_AES_256_GCM_SHA384`), as the protocol mandates secure key exchange by default.

The history of internet encryption is a perpetual race between cryptographers and cryptanalysts. The protocol formally known as SSL (Secure Sockets Layer) was developed by Netscape in the mid-1990s.

How do two computers agree on a secret key over a public, insecure channel? The answer lies in the **Diffie-Hellman (DH)** algorithm. In modern TLS, we use the Elliptic Curve variant (ECDHE), which provides the same security as standard DH but with significantly smaller keys, reducing the handshake size.

ECDHE operates on the principle that while it is easy to multiply a point on a curve by a scalar, it is computationally impossible to "divide" a point to find the scalar (the **Elliptic Curve Discrete Logarithm Problem**).

The security of the link depends on the Discrete Logarithm Problem (DLP). In a post-quantum world, Shor's algorithm can solve this in polynomial time, necessitating the shift to ML-KEM (Kyber) and ML-DSA (Dilithium).

Encryption isn't free. Every TLS connection begins with a "Handshake Tax"—the time spent negotiating ciphers, verifying certificates, and calculating shared secrets.

• Full Handshake (2-RTT):

  Classic TLS 1.2 requires two full round-trips before data can flow. In high-latency satellite or trans-oceanic links, this can add 500ms+ of delay.

• 0-RTT (Early Data):

  TLS 1.3 allows clients to send data in the very first packet if they have connected to the server previously. While incredibly fast, it introduces risks of **Replay Attacks** if the application layer isn't designed to handle it.

Shor's Algorithm, running on a sufficiently large quantum computer, could theoretically factor the large prime numbers that underpin RSA and solve discrete logs for ECDSA in polynomial time. This would render all current asymmetric key exchanges useless.

To counter this, NIST and the cryptographic community are developing **Post-Quantum Cryptography (PQC)**. Algorithms like **Kyber** (a lattice-based Key Encapsulation Mechanism) are currently being integrated into the "Hybrid" TLS handshake, where a connection is secured by both a classical (ECDHE) and a quantum-safe (Kyber) key simultaneously.