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.
Какво казват хората - Напишете рецензия
Отзивите не се потвърждават, но Google ги проверява за фалшиво съдържание и го премахва, когато такова бъде идентифицирано
LibraryThing ReviewПотребителски отзив - antao - LibraryThing
Google does not really need to crack encryption! If you are using a Google search engine or a Chrome Browser, the information may not be tagged to you individually, but the global use is factored in ... Прочетете пълната рецензия
How Things Can Go Wrong
Cryptographic vs NonCryptographic PRNGS
How to Construct Block Ciphers
An Authenticated Cipher Faster than GCM
The Discrete Logarithm Problem
Signing with RSA
Други издания - Преглед на всички
actual algorithm allows applications attack authenticated bits block cipher break bytes called certificate Chapter ciphertext client collision combination complexity compression compute construction create crypto cryptographic decrypt designed determine Diffie-Hellman discussed efficient elliptic curve encryption entropy equal equation example factoring Figure four given hard hash function implementation initial input insecure internal least length LFSR Listing look means memory mode multiple nonce NOTE operations output padding perform permutation plaintext points possible practice prime private key PRNG probability problem produce proof protocol public key quantum random require resistance result rounds scheme secret sends server shared shown shows signature simple solve specific standard stream ciphers string takes tion verify weak