Network Security

Private Communication in a Public World

Af Charlie Kaufman, Radia Perlman, Mike Speciner, Ray Perlner
Detaljer 3. Udgave Pearson Education, Limited
ISBN 9780136643609
Sprog Engelsk
Pris 616,00 kr.
Hardback

Ikke på lager

Ikke på lager. Bestil nu og få den leveret om ca. 15 hverdage

The classic guide to cryptography and network security - now fully updated!

"Alice and Bob are back!"

Widely regarded as the most comprehensive yet comprehensible guide to network security and cryptography, the previous editions of Network Security received critical acclaim for lucid and witty explanations of the inner workings of cryptography and network security protocols. In this edition, the authors have significantly updated and revised the previous content, and added new topics that have become important.

This book explains sophisticated concepts in a friendly and intuitive manner. For protocol standards, it explains the various constraints and committee decisions that led to the current designs. For cryptographic algorithms, it explains the intuition behind the designs, as well as the types of attacks the algorithms are designed to avoid. It explains implementation techniques that can cause vulnerabilities even if the cryptography itself is sound. Homework problems deepen your understanding of concepts and technologies, and an updated glossary demystifies the field's jargon. Network Security, Third Edition will appeal to a wide range of professionals, from those who design and evaluate security systems to system administrators and programmers who want a better understanding of this important field. It can also be used as a textbook at the graduate or advanced undergraduate level.

Coverage includes

  • Network security protocol and cryptography basics
  • Design considerations and techniques for secret key and hash algorithms (AES, DES, SHA-1, SHA-2, SHA-3)
  • First-generation public key algorithms (RSA, Diffie-Hellman, ECC)
  • How quantum computers work, and why they threaten the first-generation public key algorithms
  • Quantum-safe public key algorithms: how they are constructed, and optimizations to make them practical
  • Multi-factor authentication of people
  • Real-time communication (SSL/TLS, SSH, IPsec) 
  • New applications (electronic money, blockchains)
  • New cryptographic techniques (homomorphic encryption, secure multiparty computation)

 


Chapter 1 Introduction
1.1 Opinions, Products
1.2 Roadmap to the Book
1.3 Terminology
1.4 Notation
1.5 Cryptographically Protected Sessions
1.6 Active and Passive Attacks
1.7 Legal Issues
1.7.1 Patents
1.7.2 Government Regulations
1.8 Some Network Basics
1.8.1 Network Layers
1.8.2 TCP and UDP Ports
1.8.3 DNS (Domain Name System)
1.8.4 HTTP and URLs
1.8.5 Web Cookies
1.9 Names for Humans
1.10 Authentication and Authorization
1.10.1 ACL (Access Control List)
1.10.2 Central Administration/Capabilities
1.10.3 Groups
1.10.4 Cross-Organizational and Nested Groups
1.10.5 Roles
1.11 Malware: Viruses, Worms, Trojan Horses
1.11.1 Where Does Malware Come From?
1.11.2 Virus Checkers
1.12 Security Gateway
1.12.1 Firewall
1.12.2 Application-Level Gateway/Proxy
1.12.3 Secure Tunnels
1.12.4 Why Firewalls Don''t Work
1.13 Denial-of-Service (DoS) Attacks
1.14 NAT (Network Address Translation)
1.14.1 Summary
Chapter 2 Introduction to Cryptography
2.1 Introduction
2.1.1 The Fundamental Tenet of Cryptography
2.1.2 Keys
2.1.3 Computational Difficulty
2.1.4 To Publish or Not to Publish
2.1.5 Earliest Encryption
2.1.6 One-Time Pad (OTP)
2.2 Secret Key Cryptography
2.2.1 Transmitting Over an Insecure Channel
2.2.2 Secure Storage on Insecure Media
2.2.3 Authentication
2.2.4 Integrity Check
2.3 Public Key Cryptography
2.3.1 Transmitting Over an Insecure Channel
2.3.2 Secure Storage on Insecure Media
2.3.3 Authentication
2.3.4 Digital Signatures
2.4 Hash Algorithms
2.4.1 Password Hashing
2.4.2 Message Integrity
2.4.3 Message Fingerprint
2.4.4 Efficient Digital Signatures
2.5 Breaking an Encryption Scheme
2.5.1 Ciphertext Only
2.5.2 Known Plaintext
2.5.3 Chosen Plaintext
2.5.4 Chosen Ciphertext
2.5.5 Side-Channel Attacks
2.6 Random Numbers
2.6.1 Gathering Entropy
2.6.2 Generating Random Seeds
2.6.3 Calculating a Pseudorandom Stream from the Seed
2.6.4 Periodic Reseeding
2.6.5 Types of Random Numbers
2.6.6 Noteworthy Mistakes
2.7 Numbers
2.7.1 Finite Fields
2.7.2 Exponentiation
2.7.3 Avoiding a Side-Channel Attack
2.7.4 Types of Elements used in Cryptography
2.7.5 Euclidean Algorithm
2.7.6 Chinese Remainder Theorem
2.8 Homework
Chapter 3 Secret Key Cryptography
3.1 Introduction
3.2 Generic Block Cipher Issues
3.2.1 Blocksize, Keysize
3.2.2 Completely General Mapping
3.2.3 Looking Random
3.3 Constructing a Practical Block Cipher
3.3.1 Per-Round Keys
3.3.2 S-boxes and Bit Shuffles
3.3.3 Feistel Ciphers
3.4 Choosing Constants
3.5 Data Encryption Standard (DES)
3.5.1 DES Overview
3.5.2 The Mangler Function
3.5.3 Undesirable Symmetries
3.5.4 What''s So Special About DES?
3.6 3DES (Multiple Encryption DES)
3.6.1 How Many Encryptions?
3.6.1.1 Encrypting Twice with the Same Key
3.6.1.2 Encrypting Twice with Two Keys
3.6.1.3 Triple Encryption with Only Two Keys
3.6.2 Why EDE Rather Than EEE?
3.7 Advanced Encryption Standard (AES)
3.7.1 Origins of AES
3.7.2 Broad Overview
3.7.3 AES Overview
3.7.4 Key Expansion
3.7.5 Inverse Rounds
3.7.6 Software Implementations of AES
3.8 RC4
3.9 Homework
Chapter 4 Modes of Operation
4.1 Introduction
4.2 Encrypting a Large Message
4.2.1 ECB (Electronic Code Book)
4.2.2 CBC (Cipher Block Chaining)
4.2.2.1 Randomized ECB
4.2.2.2 CBC
4.2.2.3 CBC Threat--Modifying Ciphertext Blocks
4.2.3 CTR (Counter Mode)
4.2.3.1 Choosing IVs for CTR Mode
4.2.4 XEX (XOR Encrypt XOR)
4.2.5 XTS (XEX with Ciphertext Stealing)
4.3 Generating MACs
4.3.1 CBC-MAC
4.3.1.1 CBC Forgery Attack
4.3.2 CMAC
4.3.3 GMAC
4.3.3.1 GHASH
4.3.3.2 Transforming GHASH into GMAC
4.4 Ensuring Privacy and Integrity Together
4.4.1 CCM (Counter with CBC-MAC)
4.4.2 GCM (Galois/Counter Mode)
4.5 Performance Issues
4.6 Homework
Chapter 5 Cryptographic Hashes
5.1 Introduction
5.2 The Birthday Problem
5.3 A Brief History of Hash Functions
5.4 Nifty Things to Do with a Hash
5.4.1 Digital Signatures
5.4.2 Password Database
5.4.3 Secure Shorthand of Larger Piece of Data
5.4.4 Hash Chains
5.4.5 Blockchain
5.4.6 Puzzles
5.4.7 Bit Commitment
5.4.8 Hash Trees
5.4.9 Authentication
5.4.10 Computing a MAC with a Hash
5.4.11 HMAC
5.4.12 Encryption with a Secret and a Hash Algorithm
5.5 Creating a Hash Using a Block Cipher
5.6 Construction of Hash Functions
5.6.1 Construction of MD4, MD5, SHA-1 and SHA-2
5.6.2 Construction of SHA-3
5.7 Padding
5.7.1 MD4, MD5, SHA-1, and SHA2-256 Message Padding
5.7.2 SHA-3 Padding Rule
5.8 The Internal Encryption Algorithms
5.8.1 SHA-1 Internal Encryption Algorithm
5.8.2 SHA-2 Internal Encryption Algorithm
5.9 SHA-3 f Function (Also Known as KECCAK-f)
5.10 Homework
Chapter 6 First-Generation Public Key Algorithms
6.1 Introduction
6.2 Modular Arithmetic
6.2.1 Modular Addition
6.2.2 Modular Multiplication
6.2.3 Modular Exponentiation
6.2.4 Fermat''s Theorem and Euler''s Theorem
6.3 RSA
6.3.1 RSA Algorithm
6.3.2 Why Does RSA Work?
6.3.3 Why Is RSA Secure?
6.3.4 How Efficient Are the RSA Operations?
6.3.4.1 Exponentiating with Big Numbers
6.3.4.2 Generating RSA Keys
6.3.4.3 Why a Non-Prime Has Multiple Square Roots of One
6.3.4.4 Having a Small Constant e
6.3.4.5 Optimizing RSA Private Key Operations
6.3.5 Arcane RSA Threats
6.3.5.1 Smooth Numbers
6.3.5.2 The Cube Root Problem
6.3.6 Public-Key Cryptography Standard (PKCS)
6.3.6.1 Encryption
6.3.6.2 The Million-Message Attack
6.3.6.3 Signing
6.4 Diffie-Hellman
6.4.1 MITM (Meddler-in-the-Middle) Attack
6.4.2 Defenses Against MITM Attack
6.4.3 Safe Primes and the Small-Subgroup Attack
6.4.4 ElGamal Signatures
6.5 Digital Signature Algorithm (DSA)
6.5.1 The DSA Algorithm
6.5.2 Why Is This Secure?
6.5.3 Per-Message Secret Number
6.6 How Secure Are RSA and Diffie-Hellman?
6.7 Elliptic Curve Cryptography (ECC) &