book

Implementing SSL/TLS Using Cryptography and PKI

by Joshua Davies

January 2011

Intermediate to advanced

696 pages

16h 56m

English

Wiley

Read now

Unlock full access

Supplemental Web SitesRoadmap and Companion Source CodeOutline of the BookHow to Read This Book
What Are Secure Sockets?Insecure Communications: Understanding the HTTP ProtocolRoadmap for the Rest of This Book
Understanding Block Cipher Cryptography AlgorithmsUnderstanding Stream Cipher Algorithms
Understanding the Theory Behind the RSA AlgorithmPerforming Arbitrary Precision Binary Math to Implement Public-Key CryptographyEncryption and Decryption with RSAAchieving Perfect Forward Secrecy with Diffie-Hellman Key ExchangeGetting More Security per Key Bit: Elliptic Curve CryptographyMaking ECC Work with Whole Integers: Elliptic-Curve Cryptography over Fp
Using Message Digests to Create Secure Document Surrogates
Putting It Together: The Secure Channel ProtocolEncoding with ASN.1Developing an ASN.1 ParserManaging CertificatesOther Problems with Certificates
Implementing the TLS 1.0 Handshake (Client Perspective)Secure Data Transfer with TLSImplementing TLS ShutdownExamining HTTPS End-to-End Examples (TLS 1.0)Differences Between SSL 3.0 and TLS 1.0Differences Between TLS 1.0 and TLS 1.1
Implementing the TLS 1.0 Handshake from the Server's PerspectiveAvoiding Common Pitfalls When Adding HTTPS Support to a ServerWhen a Browser Displays Errors: Browser Trust Issues
Passing Additional Information with Client Hello ExtensionsSafely Reusing Key Material with Session ResumptionAvoiding Fixed Parameters with Ephemeral Key ExchangeVerifying Identity with Client AuthenticationDealing with Legacy Implementations: Exportable CiphersDiscarding Key Material Through Session Renegotiation
Supporting TLS 1.2 When You Use RSA for the Key ExchangeImpact to Diffie-Hellman Key ExchangeAdding Support for AEAD Mode CiphersWorking ECC Extensions into the TLS LibraryThe Current State of TLS 1.2
Adding the NTTPS Extension to the NTTP AlgorithmImplementing "Multi-hop" SMTP over TLS and Protecting Email Content with S/MIMESecuring Datagram TrafficSupporting SSL When Proxies Are InvolvedSSL with OpenSSL
The Decimal and Binary Numbering SystemsUnderstanding Binary Logical OperationsTwo's-Complement Representation of Negative NumbersBig-Endian versus Little-Endian Number Formats
Installing TCPDumpInstalling OpenSSL
Implementing the SSL Handshake

Content preview from Implementing SSL/TLS Using Cryptography and PKI

APPENDIX A

Binary Representation of Integers: A Primer

If you know how to program in C, you must have spent some time looking at machine-level details, including binary number representations, as you learned it. This appendix covers some of these details that you were probably familiar with at one point, but have since (maybe willfully) forgotten.

The Decimal and Binary Numbering Systems

Humans use a base-10 numbering system. Ten unique digits (including 0) represent the first nine ordinal numbers. After the ninth position, you use multiple digits to represent numerals. Anthropologists believe that the base-10 numbering system, which is ubiquitous in almost all human societies, came about because humans have 10 fingers. As it turns out, though, computers have just one such "finger" because they're electrical machines. I'll go out on a limb and assume you interact with electricity at least occasionally when you turn on a light switch — the switch is the counter which can be in two states: on and off. If it's on, electricity flows; if it's off, it doesn't.

To grossly oversimplify, a CPU is nothing but a series of interrelated electronic switches. Numbers are represented by unique combinations of multiple switches. One such switch can count two unique values. Two switches can count four: on-on, on-off, off-on and off-off. Three switches can count eight values, and n switches can count 2ⁿ values. Most modern computers are said to be 32-bit processors, which means that the internal ...