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

21.4 Sweet32

SWEET32 [30] is a generic attack against block ciphers with a block size of 64 bits in CBC mode, such as DES or 3DES. However, it has special relevance for TLS because until TLS 1.1, 3DES was mandatory to implement for a TLS library, and TLS 1.2 still contains corresponding cipher suites.

21.4.1 The attack

Recall that in the CBC mode of some block cipher Fk, the i-th plaintext block Pi is encrypted as

Ci = Fk(Pi ⊕ Ci−1).

If a large amount of plaintext is encrypted, there might be another plaintext block Pj that generates the same cipher block. Such an occurrence is called a collision. In this case, we have

C = C = F (P ⊕ C ). j i k j j− 1

This means the input block to Fk must be the same:

Pi ⊕ Ci−1 = Pj ⊕ Cj−1,

or finally,

P ⊕ P = C ⊕ C . i j i−1 j−1

As the right-hand side is known, the attacker learns PiPj. This knowledge can be useful in these cases:

  • If some secret information Pi, for example, an authentication cookie, is repeatedly sent by the victim

  • If some portion Pj of the plaintext is known

These two conditions are usually fulfilled in HTTP...