Book Image

TLS Cryptography In-Depth

By : Dr. Paul Duplys, Dr. Roland Schmitz
Book Image

TLS Cryptography In-Depth

By: Dr. Paul Duplys, Dr. Roland Schmitz

Overview of this book

TLS is the most widely used cryptographic protocol today, enabling e-commerce, online banking, and secure online communication. Written by Dr. Paul Duplys, Security, Privacy & Safety Research Lead at Bosch, and Dr. Roland Schmitz, Internet Security Professor at Stuttgart Media University, this book will help you gain a deep understanding of how and why TLS works, how past attacks on TLS were possible, and how vulnerabilities that enabled them were addressed in the latest TLS version 1.3. By exploring the inner workings of TLS, you’ll be able to configure it and use it more securely. Starting with the basic concepts, you’ll be led step by step through the world of modern cryptography, guided by the TLS protocol. As you advance, you’ll be learning about the necessary mathematical concepts from scratch. Topics such as public-key cryptography based on elliptic curves will be explained with a view on real-world applications in TLS. With easy-to-understand concepts, you’ll find out how secret keys are generated and exchanged in TLS, and how they are used to creating a secure channel between a client and a server. By the end of this book, you’ll have the knowledge to configure TLS servers securely. Moreover, you’ll have gained a deep knowledge of the cryptographic primitives that make up TLS.
Table of Contents (30 chapters)
1
Part I Getting Started
8
Part II Shaking Hands
16
Part III Off the Record
22
Part IV Bleeding Hearts and Biting Poodles
27
Bibliography
28
Index

3.2 Cryptographic keys

We saw in the last section that keys are extremely important because they are the only things that are supposed to be secret in a cryptosystem. But what exactly is a key?

A cryptographic key K comes from a large (but finite) set 𝒦. This large set is called the key space. If we assume that K is some bit sequence of length N, then 𝒦 = {0,1}N and the size of 𝒦 is 2N.

Figure 3.1: A cryptographic key k, the shared secret between Alice and Bob that ensures the security of their communication, is an element of a large (but finite) key space 𝒦. If the length of the key is N bits, then the size of 𝒦 is 2N

Figure 3.1: A cryptographic key k, the shared secret between Alice and Bob that ensures the security of their communication, is an element of a large (but finite) key space 𝒦. If the length of the key is N bits, then the size of 𝒦 is 2N

Naturally, we only want Alice and Bob to know the key, so Eve should neither be able to guess K, nor should she be able to eavesdrop on K when it is exchanged or obtain K by other means. These other means can be anything from a malware attack on Alice or Bob to spying on the electromagnetic radiation emanating from their...