Cryptography for Developers

Cryptography for Developers gives developers the practical cryptographic tools they need in their daily work. It also provides them the contextual knowledge to understand how these 21st-century cryptographic tools have been fashioned in response to theoretical and technological advances in mathematics and computers that rendered the paradigms of classic and late 20th-century cryptography obsolete. The book focuses on the recipes for algorithms most commonly deployed by developers in practical applications, without delving into the details of the mathematical theory underlying them. The technical presentation of each algorithm in code is accompanied by a narrative account of the algorithm's applications and historical development. Depending on the reader's interest level, Cryptography for Developers may be read in its entirety or in its thematic parts, either as a technical manual of algorithms or as an introductory survey of modern cryptography. The technical heart of Cryptography for Developers describes cryptographic algorithms in current use, explains how they work and how to use them, and provides abundant practical examples from the libraries of popular programming languages, including Ruby, Java, C, PHP, JavaScript, Python, and Perl. Software architect Jose Maria Estevez proceeds to demonstrate with plentiful examples the protocols for combining algorithms and the methods for solving cryptographic problems commonly encountered by developers. The narrative portion of the book surveys the development of classical cryptography from ancient Athens through World War II, the computerization of cryptography in the second half of the 20th century, the explosive growth and proliferation of modern cryptography since the turn of the 21st century, and the forecast for future cryptographic developments driven by quantum computing and other technological and social trends.

Table of Contents:
Chapter 1. Cryptography, Cryptosystems, and Security Metrics * Cryptography Defined* How to Secure a Cryptosystem* How to Break a Cryptosystem* How to Measure Security Chapter 2. Classic Cryptosystems * Preindustrial Cryptography* Types* Substitution* Transposition* Modular arithmetic* Addition* Early cryptography* Atbash* Scytale* Caesar* Alberti* Vigenere* Bifid* Book Cypher* One Time Pad* Adfgvx* Industrial Cryptography* Mechanized and Automated Methods* Mathematical Generation* Vernan (XOR)* Lorentz* Enigma Chapter 3. Modern Cryptosystems * Computerized Mathematical Algorithms* Properties and Classification * Privacy* Non-Repudiation* Integrity* Confidentiality* Families* Symmetric* Asymmetric* Hash functions / hmac* Symmetric Algorithms* Modes* Algorithms*3DES* AES* Twofish* Serpent* Asymmetric* Usages* Algorithms* RSA* Elliptic Curves* ECDH* DH Key Exchange* ElGamal* Hash Functions* Usages* Integrity* Digital signature* Key search* Salt* Key stretching* HMAC* Algorithms* MD5* SHA-2* SHA-3 (Keccak)* Scrypt* Pbkdf2 Chapter 4. Protocols for Combining Algorithms * How to Combine Different Algorithms to Create Complex Cryptosystems* Examples* Key Exchange* Man in the Middle* Digital Signature* SSL* Current Problems and Certificates.* Certificate Transparency* WEP* WPA* Bitcoin Chapter 5. Caveats and Pitfalls * Random Number Generation* Keep the Secret* Combine the Algorithms* Don't Reduce the Security* Weakest Link* Secure Coding: Sometimes Implementation Leads to a Security Break* Example: Heartbleed* Don't Design Your Own Algorithm* Side Channels Leakage* Security through Obscurity* Special Mention: Steganography Chapter 6. Future Cryptosystems * The Quantum Threat to Current Cryptography (Shor's Algorithm)* Algorithms* Pure Quantic* Quantic Resistant* How Robust Algorithms and Key Size Are Impacted by Quantum Computing Appendix A. Algorithms Tabulated by Properties, Strengths, and Key Length Appendix B. Libraries Linked with Algorithms Treated in the Book