Search icon
Arrow left icon
All Products
Best Sellers
New Releases
Books
Videos
Audiobooks
Learning Hub
Newsletters
Free Learning
Arrow right icon
TLS Cryptography In-Depth

You're reading from  TLS Cryptography In-Depth

Product type Book
Published in Jan 2024
Publisher Packt
ISBN-13 9781804611951
Pages 712 pages
Edition 1st Edition
Languages
Authors (2):
Dr. Paul Duplys Dr. Paul Duplys
Profile icon Dr. Paul Duplys
Dr. Roland Schmitz Dr. Roland Schmitz
Profile icon Dr. Roland Schmitz
View More author details

Table of Contents (30) Chapters

Preface 1. Part I Getting Started
2. Chapter 1: The Role of Cryptography in the Connected World 3. Chapter 2: Secure Channel and the CIA Triad 4. Chapter 3: A Secret to Share 5. Chapter 4: Encryption and Decryption 6. Chapter 5: Entity Authentication 7. Chapter 6: Transport Layer Security at a Glance 8. Part II Shaking Hands
9. Chapter 7: Public-Key Cryptography 10. Chapter 8: Elliptic Curves 11. Chapter 9: Digital Signatures 12. Chapter 10: Digital Certificates and Certification Authorities 13. Chapter 11: Hash Functions and Message Authentication Codes 14. Chapter 12: Secrets and Keys in TLS 1.3 15. Chapter 13: TLS Handshake Protocol Revisited 16. Part III Off the Record
17. Chapter 14: Block Ciphers and Their Modes of Operation 18. Chapter 15: Authenticated Encryption 19. Chapter 16: The Galois Counter Mode 20. Chapter 17: TLS Record Protocol Revisited 21. Chapter 18: TLS Cipher Suites 22. Part IV Bleeding Hearts and Biting Poodles
23. Chapter 19: Attacks on Cryptography 24. Chapter 20: Attacks on the TLS Handshake Protocol 25. Chapter 21: Attacks on the TLS Record Protocol 26. Chapter 22: Attacks on TLS Implementations 27. Bibliography
28. Index
29. Other Books You Might Enjoy

20.4 Padding oracle attacks on TLS handshake

The term oracle originally comes from complexity theory, where it is used to compare the complexity of two computational problems P1,P2.

Suppose we can solve P1 efficiently (i.e., in polynomial time), if there is a polynomial-time algorithm A to solve P2. In this situation, we say that P1 polytime reduces to P2, or

P ≤ P 1 p 2

Informally, we can say that P2 is at least as hard as P1 ([117]). Now, the (hypothetical) algorithm A that can efficiently solve P2 is called an oracle for P2.

As an example, let P1 be the RSA-problem and P2 be the integer factorization problem. Recall from Chapter 7, Public-Key Cryptography, that the RSA problem means we have to find the plaintext m, given the ciphertext

c = me mod n

and the public key (e,n), while the integer factorization problems is to find the prime factors of a given integer.

Now it is easy to see that if we had an oracle that provides us with the prime factors of n in polynomial time, we could also solve the...

lock icon The rest of the chapter is locked
Register for a free Packt account to unlock a world of extra content!
A free Packt account unlocks extra newsletters, articles, discounted offers, and much more. Start advancing your knowledge today.
Unlock this book and the full library FREE for 7 days
Get unlimited access to 7000+ expert-authored eBooks and videos courses covering every tech area you can think of
Renews at $15.99/month. Cancel anytime}