book

Serious Cryptography, 2nd Edition

Name: Serious Cryptography, 2nd Edition
Author: Jean-Philippe Aumasson
ISBN: 9781718503847

by Jean-Philippe Aumasson

October 2024

Intermediate to advanced

376 pages

10h 44m

English

No Starch Press

Read now

Unlock full access

Praise for Serious Cryptography
Title Page
Copyright
About the Author and Technical Reviewer
Foreword to the First Edition
Acknowledgments
Introduction
This Book’s ApproachWho This Book Is ForHow This Book Is OrganizedOn the Second Edition
List of Abbreviations
Part I: Fundamentals
1. Encryption
The BasicsClassical CiphersThe Caesar CipherThe Vigenère CipherHow Ciphers WorkThe PermutationThe Mode of OperationWhy Classical Ciphers Are InsecureThe Perfect Cipher: The One-Time PadEncryption and DecryptionWhy Is the One-Time Pad Secure?Encryption SecurityAttack ModelsSecurity GoalsSecurity NotionsAsymmetric EncryptionWhen Ciphers Do More Than EncryptionAuthenticated EncryptionFormat-Preserving EncryptionFully Homomorphic EncryptionSearchable EncryptionTweakable EncryptionHow Things Can Go WrongWeak CipherWrong ModelFurther Reading

2. Randomness
Random or Nonrandom?Randomness as a Probability DistributionEntropy: A Measure of UncertaintyRandom and Pseudorandom Number GeneratorsHow PRNGs WorkSecurity ConcernsThe PRNG FortunaCryptographic vs. Noncryptographic PRNGsThe Uselessness of Statistical TestsReal-World PRNGsRandom Bits in LinuxThe CryptGenRandom() Function in WindowsA Hardware-Based PRNG: Intel Secure KeyHow Things Can Go WrongPoor Entropy SourcesInsufficient Entropy at Boot TimeNoncryptographic PRNGSampling Bug with Strong RandomnessFurther Reading
3. Cryptographic Security
Defining the ImpossibleSecurity in Theory: Unconditional SecuritySecurity in Practice: Computational SecurityQuantifying SecurityMeasuring Security in BitsCalculating the Full Attack CostChoosing and Evaluating Security LevelsAchieving SecurityProvable SecurityHeuristic SecurityGenerating KeysSymmetric KeysAsymmetric KeysProtecting KeysHow Things Can Go WrongIncorrect Security ProofShort Keys for Legacy SupportFurther Reading
Part II: Symmetric Crypto
4. Block Ciphers
What Is a Block Cipher?Security GoalsBlock SizeThe Codebook AttackHow to Construct Block CiphersA Block Cipher’s RoundsThe Slide Attack and Round KeysSubstitution–Permutation NetworksFeistel SchemesThe Advanced Encryption StandardAES InternalsAES in ActionHow to Implement AESTable-Based ImplementationsNative InstructionsAES SecurityModes of OperationElectronic Codebook ModeCipher Block Chaining ModeMessage Encryption in CBC ModeCounter ModeHow Things Can Go WrongMeet-in-the-Middle AttacksPadding Oracle AttacksFurther Reading
5. Stream Ciphers
How Stream Ciphers WorkHardware-Oriented Stream CiphersFeedback Shift RegistersGrain-128aA5/1Software-Oriented Stream CiphersRC4 Salsa20How Things Can Go WrongNonce ReuseBroken RC4 ImplementationWeak Ciphers Baked into HardwareFurther Reading
6. Hash Functions
Secure Hash FunctionsUnpredictability AgainPreimage ResistanceCollision ResistanceHow to Find CollisionsHow to Build Hash FunctionsCompression-Based Hash FunctionsPermutation-Based Hash FunctionsThe SHA Family of Hash FunctionsSHA-1SHA-2The SHA-3 CompetitionKeccak (SHA-3)The BLAKE2 and BLAKE3 Hash FunctionsHow Things Can Go WrongThe Length-Extension AttackFooling Proof-of-Storage ProtocolsFurther Reading
7. Keyed Hashing
Message Authentication CodesMACs in Secure CommunicationForgery and Chosen-Message AttacksReplay AttacksPseudorandom FunctionsPRF SecurityPRFs Are Stronger Than MACsHow to Create Keyed Hashes from Unkeyed HashesThe Secret-Prefix ConstructionThe Secret-Suffix ConstructionThe HMAC ConstructionA Generic Attack Against Hash-Based MACsHow to Create Keyed Hashes from Block CiphersBreaking CBC-MACFixing CBC-MACDedicated MAC DesignsPoly1305SipHashHow Things Can Go WrongTiming Attacks on MAC VerificationWhen Sponges LeakFurther Reading
8. Authenticated Encryption
Authenticated Encryption Using MACsEncrypt-and-MAC ApproachMAC-Then-Encrypt CompositionEncrypt-Then-MAC CompositionAuthenticated CiphersAuthenticated Encryption with Associated DataPredictability and NoncesCriteria for a Good Authenticated CipherThe AES-GCM Authenticated Cipher StandardGCM InternalsGCM SecurityGCM EfficiencyThe OCB Authenticated Cipher ModeOCB InternalsOCB SecurityOCB EfficiencyThe SIV Authenticated Cipher ModePermutation-Based AEADHow Things Can Go WrongAES-GCM and Weak Hash KeysAES-GCM and Small TagsFurther Reading
Part III: Asymmetric Crypto
9. Hard Problems
Computational HardnessRunning TimePolynomial vs. Superpolynomial TimeComplexity ClassesNondeterministic Polynomial TimeNP-Complete ProblemsThe P vs. NP ProblemThe Factoring ProblemFactoring Large NumbersFactoring Is Probably Not NP-HardThe Discrete Logarithm ProblemGroupsThe Hard ThingHow Things Can Go WrongWhen Factoring Is EasySmall Hard Problems Aren’t HardFurther Reading
10. RSA
The Math Behind RSAThe RSA Trapdoor PermutationRSA Key Generation and SecurityEncrypting with RSATextbook RSA Encryption’s MalleabilityStrong RSA Encryption with OAEPSigning with RSATextbook RSA SignaturesThe PSS Signature StandardFull Domain Hash SignaturesRSA ImplementationsA Fast Exponentiation AlgorithmSmall Exponents for Faster Public-Key OperationsThe Chinese Remainder TheoremHow Things Can Go WrongThe Bellcore Attack on RSA-CRTShared Private Exponents or ModuliFurther Reading
11. Diffie–Hellman
The Diffie–Hellman FunctionThe Diffie–Hellman ProblemsThe Computational ProblemThe Decisional ProblemVariants of Diffie–HellmanKey Agreement ProtocolsNon-DH Key AgreementAttack Models for Key Agreement ProtocolsPerformanceDiffie–Hellman ProtocolsAnonymous Diffie–HellmanAuthenticated Diffie–HellmanMenezes–Qu–VanstoneHow Things Can Go WrongNot Hashing the Shared SecretAnonymous Diffie–Hellman from TLS 1.0Unsafe Group ParametersFurther Reading
12. Elliptic Curves
What Is an Elliptic Curve?Elliptic Curves Over IntegersThe Addition LawElliptic Curve GroupsThe ECDLP ProblemDiffie–Hellman Key Agreement over Elliptic CurvesSigning with Elliptic CurvesECDSA Signature GenerationECDSA Signature VerificationECDSA vs. RSA SignaturesEdDSA and Ed25519Encrypting with Elliptic CurvesChoosing a CurveNIST CurvesCurve25519Other CurvesHow Things Can Go WrongECDSA with Bad RandomnessInvalid Curve AttacksIncompatible Ed25519 Validation RulesFurther Reading
Part IV: Applications
13. TLS
Target Applications and RequirementsThe TLS Protocol SuiteThe TLS and SSL Families of ProtocolsTLS in a NutshellCertificates and Certificate AuthoritiesThe Record ProtocolThe TLS Handshake ProtocolTLS 1.3 Cryptographic AlgorithmsTLS 1.3 Improvements over TLS 1.2Downgrade ProtectionSingle Round-Trip HandshakeSession ResumptionThe Strengths of TLS SecurityAuthenticationForward SecrecyHow Things Can Go WrongCompromised Certificate AuthorityCompromised ServerCompromised ClientBugs in ImplementationsFurther Reading
14. Quantum and Post-Quantum
How Quantum Computers WorkQuantum BitsQuantum GatesQuantum SpeedupExponential Speedup and Simon’s ProblemThe Threat of Shor’s AlgorithmGrover’s AlgorithmWhy Is It So Hard to Build a Quantum Computer?Post-Quantum Cryptographic AlgorithmsCode-Based CryptographyLattice-Based CryptographyMultivariate CryptographyHash-Based CryptographyThe NIST StandardsHow Things Can Go WrongUnclear Security LevelThe Eventual Existence of Large Quantum ComputersImplementation IssuesFurther Reading
15. Cryptocurrency Cryptography
Hashing ApplicationsMerkle TreesProof of WorkHierarchical Key DerivationAlgebraic Hash FunctionsHow Things Can Go WrongMultisignature ProtocolsMultiple Multiparty SignaturesSchnorr Signature ProtocolsHow Things Can Go WrongSafer Schnorr MultisignaturesAggregate Signature ProtocolsPairingsBLS SignaturesHow Things Can Go WrongThreshold Signature ProtocolsUse CasesSecurity ModelSecret-Sharing TechniquesThe Trivial CaseThe Simple CaseThe Hard CaseHow Things Can Go WrongZero-Knowledge ProofsSecurity ModelSchnorr’s ProtocolNoninteractive ProofszkSNARKsFrom Statements to ProofsHow Things Can Go WrongReally Serious Crypto
Index

Content preview from Serious Cryptography, 2nd Edition

`8` `AUTHENTICATED ENCRYPTION`

This chapter is about a type of algorithm that protects not only a message’s confidentiality but also its authenticity. Recall from Chapter 7 that message authentication codes (MACs) protect a message’s authenticity by creating a tag, which is a kind of signature. Like MACs, the authenticated encryption (AE) algorithms in this chapter produce an authentication tag, but they also encrypt the message. In other words, a single AE algorithm offers the features of both a normal cipher and a MAC.

Combining a cipher and a MAC can achieve varying levels of authenticated encryption, as you’ll learn throughout this chapter. ...

Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.

Read now

Unlock full access

More than 5,000 organizations count on O’Reilly

O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.

Julian F.

Head of Cybersecurity

I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.

Addison B.

Field Engineer

I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.

Amir M.

Data Platform Tech Lead

I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.

Mark W.

Embedded Software Engineer

Publisher Resources

ISBN: 9781098182472Errata Page

Cloud Computing

Data Engineering

Data Science

AI & ML

Programming Languages

Software Architecture

IT/Ops

Security

Design

Business

Soft Skills

Serious Cryptography, 2nd Edition

by Jean-Philippe Aumasson

`8` `AUTHENTICATED ENCRYPTION`

Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.