Serious Cryptography: A Practical Introduction to Modern Encryption
No Starch Press, 21.11.2017 г. - 312 страници
This practical guide to modern encryption breaks down the fundamental mathematical concepts at the heart of cryptography without shying away from meaty discussions of how they work. You’ll learn about authenticated encryption, secure randomness, hash functions, block ciphers, and public-key techniques such as RSA and elliptic curve cryptography.
You’ll also learn:
- Key concepts in cryptography, such as computational security, attacker models, and forward secrecy
- The strengths and limitations of the TLS protocol behind HTTPS secure websites
- Quantum computation and post-quantum cryptography
- About various vulnerabilities by examining numerous code examples and use cases
- How to choose the best algorithm or protocol and ask vendors the right questions
Each chapter includes a discussion of common implementation mistakes using real-world examples and details what could go wrong and how to avoid these pitfalls.
Whether you’re a seasoned practitioner or a beginner looking to dive into the field, Serious Cryptography will provide a complete survey of modern encryption and its applications.
Какво казват хората - Напишете рецензия
Не намерихме рецензии на обичайните места.
Foreword by Matthew D Green Preface
Randomness Chapter 3 Cryptographic Security Chapter 4 Block Ciphers Chapter 5 Stream Ciphers Chapter 6 Hash Functions Chapter 7 Keyed Hashi...
Hard Problems Chapter 10 RSA Chapter 11 DiffieHellman Chapter 12 Elliptic Curves Chapter 13 TLS Chapter 14 Quantum and PostQuantum
Други издания - Преглед на всички
0xff 32-bit words AES-GCM Alice applications attack model authenticated cipher authenticated encryption authentication tag BLAKE2 block cipher break bytes called certificate Chapter ciphertext block client collision complexity compression function crypto cryptographic Diffie–Hellman ECDSA elliptic curve elliptic curve cryptography entropy equation example exponent exponential factoring faster GHASH hard hardware hash function hash value HMAC implementation initial input insecure integers key agreement protocol keystream length LFSR message blocks mode modulo multiple NIST nonce NP-complete one-time pad OpenSSL operations output padding oracle parameters permutation plaintext plaintext block points polynomial post-quantum preimage prime number private key PRNG problem pseudorandom public key quantum computer qubits random bits round key Salsa20 secret key security level server shared secret shown in Figure signature scheme solve stream ciphers string takes there’s universal hash verify Vigenère cipher