Enhanced descriptions from Syndetics:

Disappearing Cryptography, Second Edition describes how to take words, sounds, or images and hide them in digital data so they look like other words, sounds, or images. When used properly, this powerful technique makes it almost impossible to trace the author and the recipient of a message. Conversations can be submerged in the flow of information through the Internet so that no one can know if a conversation exists at all. This full revision of the best-selling first edition describes a number of different techniques to hide information. These include encryption, making data incomprehensible; steganography, embedding information into video, audio, or graphics files; watermarking, hiding data in the noise of image or sound files; mimicry, "dressing up" data and making it appear to be other data, and more. The second edition also includes an expanded discussion on hiding information with spread-spectrum algorithms, shuffling tricks, and synthetic worlds. Each chapter is divided into sections, first providing an introduction and high-level summary for those who want to understand the concepts without wading through technical explanations, and then presenting greater detail for those who want to write their own programs. To encourage exploration, the author's Web site www.wayner.org/books/discrypt2/ contains implementations for hiding information in lists, sentences, and images.

Table of contents provided by Syndetics

• Preface (p. xiii)
• 1 Framing Information (p. 1)
• 1.1 Introduction (p. 1)
• 1.2 Reasons for Secrecy (p. 3)
• 1.3 How It Is Done (p. 5)
• 1.4 How Steganography Is Used (p. 7)
• 1.5 Attacks on Steganography (p. 9)
• 1.6 Adding Context (p. 13)
• 2 Encryption: Pure White (p. 15)
• 2.1 Encryption and White Noise (p. 16)
• 2.1.1 DES and Modern Ciphers (p. 20)
• 2.1.2 Public-Key Encryption (p. 24)
• 2.1.3 How Random Is the Noise? (p. 26)
• 2.2 Measuring Information and Encrypting It (p. 27)
• 2.2.1 Entropy (p. 28)
• 2.2.2 RSA Encryption (p. 29)
• 2.3 Summary (p. 31)
• 3 Error Correction: Close but No Cigar (p. 33)
• 3.1 Correcting Errors (p. 33)
• 3.1.1 Error Correction and White Noise (p. 40)
• 3.1.2 Error Correction and Secret Sharing (p. 41)
• 3.2 Constructing Error-Correcting Codes (p. 42)
• 3.2.1 Periodic Codes (p. 45)
• 3.3 Summary (p. 47)
• 4 Secret Sharing: Two out of Three Musketeers (p. 49)
• 4.1 Splitting Up Secrets (p. 50)
• 4.1.1 Requiring All Parts (p. 51)
• 4.1.2 Letting Parts Slide (p. 53)
• 4.1.3 A More Efficient Method (p. 55)
• 4.1.4 Providing Deniability (p. 56)
• 4.2 Building Secret-Sharing Schemes (p. 57)
• 4.2.1 Making Some More Equal (p. 59)
• 4.3 Public-Key Secret Sharing (p. 60)
• 4.4 Steganographic File Systems and Secret Sharing (p. 61)
• 4.5 Summary (p. 65)
• 5 Compression: Television Listing (p. 67)
• 5.1 Patterns and Compression (p. 68)
• 5.1.1 Huffman Coding (p. 71)
• 5.2 Building Compression Algorithms (p. 74)
• 5.2.1 Huffman Compression (p. 74)
• 5.2.2 Dictionary Compression (p. 76)
• 5.2.3 JPEG Compression (p. 78)
• 5.2.4 GZSteg (p. 79)
• 5.3 Summary (p. 80)
• 6 Basic Mimicry: Reading between the Lines (p. 81)
• 6.1 Running in Reverse (p. 82)
• 6.1.1 Choosing the Next Letter (p. 87)
• 6.2 Implementing the Mimicry (p. 89)
• 6.2.1 Goosing with Extra Data (p. 91)
• 6.2.2 Regular Mimicry and Images (p. 93)
• 6.3 Summary (p. 94)
• 7 Grammars and Mimicry: Evolution of Everyday Things (p. 97)
• 7.1 Using Grammar for Mimicry (p. 99)
• 7.1.1 Parsing and Going Back (p. 103)
• 7.1.2 How Good Is It? (p. 105)
• 7.2 Creating Grammar-Based Mimicry (p. 107)
• 7.2.1 Parsing the Output (p. 109)
• 7.2.2 Suggestions for Building Grammars (p. 111)
• 7.2.3 Scrambled Grammars (p. 112)
• 7.2.4 Assessing the Theoretical Security of Mimicry (p. 122)
• 7.2.5 Efficient Mimicry-Based Codes (p. 125)
• 7.3 Summary (p. 126)
• 8 Turing and Reverse: Doggie's Little Get Along (p. 129)
• 8.1 Running Backward (p. 130)
• 8.1.1 Reversing Gears (p. 134)
• 8.2 Building a Reversible Machine (p. 139)
• 8.2.1 Reversible Turing Machines (p. 140)
• 8.2.2 Reversible Grammar Generators (p. 141)
• 8.2.3 The Reversible Grammar Machine (p. 145)
• 8.3 Summary (p. 147)
• 9 Life in the Noise: Boy-Zs in Noizy, Idaho (p. 149)
• 9.1 Hiding in the Noise (p. 151)
• 9.1.1 Problems with the Noise (p. 153)
• 9.1.2 Good Noise? (p. 153)
• 9.1.3 Independence Problems (p. 155)
• 9.1.4 File Format Grief (p. 157)
• 9.1.5 Deniability (p. 160)
• 9.2 Bit Twiddling (p. 161)
• 9.2.1 Hide and Seek (p. 162)
• 9.2.2 EzStego (p. 165)
• 9.2.3 S-Tools (p. 167)
• 9.2.4 S-Tools and Sound Files (p. 170)
• 9.2.5 S-Tools and Empty Disk Space (p. 170)
• 9.2.6 Random Walks (p. 173)
• 9.2.7 Putting JPEG to Use (p. 175)
• 9.2.8 Hiding Information in JPEG Files (p. 177)
• 9.2.9 Outguess (p. 178)
• 9.2.10 F4 and F5 (p. 179)
• 9.3 Summary (p. 182)
• 10 Anonymous Remailers: Dr. Anon to You (p. 183)
• 10.1 Anonymous Remailers (p. 185)
• 10.1.1 Enhancements (p. 187)
• 10.1.2 Using Remailers (p. 188)
• 10.1.3 Using Private Idaho (p. 189)
• 10.1.4 Web Remailers (p. 190)
• 10.2 Remailer Guts (p. 191)
• 10.2.1 Other Remailer Packages (p. 195)
• 10.2.2 Splitting Paths (p. 196)
• 10.3 Anonymous Networks (p. 198)
• 10.3.1 Freedom Network (p. 199)
• 10.3.2 PipeNet (p. 200)
• 10.3.3 Crowds (p. 200)
• 10.3.4 Freenet (p. 201)
• 10.3.5 OceanStore (p. 203)
• 10.4 The Future (p. 203)
• 10.5 Summary (p. 204)
• 11 Secret Broadcasts: Table Talk (p. 205)
• 11.1 Secret Senders (p. 206)
• 11.2 Creating a DC Net (p. 210)
• 11.2.1 Cheating DC Nets (p. 212)
• 11.3 Summary (p. 213)
• 12 Keys: The Key Vision (p. 215)
• 12.1 Extending Control (p. 216)
• 12.2 Signing Algorithms (p. 218)
• 12.3 Public-Key Algorithms (p. 220)
• 12.3.1 Constraining Hard Problems (p. 220)
• 12.3.2 Using Matrix Multiplication (p. 223)
• 12.3.3 Removing Parts (p. 225)
• 12.4 Zero-Knowledge Approaches (p. 226)
• 12.4.1 Discrete Logs for Proofs (p. 230)
• 12.5 Collusion Control (p. 232)
• 12.6 Summary (p. 233)
• 13 Ordering and Reordering: Top 10 Reasons Why Top 10 Lists Fail (p. 235)
• 13.1 Introduction (p. 236)
• 13.2 Strength against Scrambling (p. 237)
• 13.3 Invariant Forms (p. 239)
• 13.4 Canonical Forms (p. 240)
• 13.5 Packing in Multiple Messages (p. 241)
• 13.6 Sorting to Hide Information (p. 241)
• 13.7 Adding Extra Packets (p. 244)
• 13.8 Summary (p. 245)
• 14 Spreading: A New Job (p. 247)
• 14.1 Spreading the Information (p. 249)
• 14.2 Going Digital (p. 252)
• 14.2.1 An Example (p. 254)
• 14.2.2 Synchronization (p. 257)
• 14.2.3 Strengthening the System (p. 258)
• 14.2.4 Packing Multiple Messages (p. 259)
• 14.3 Comparative Blocks (p. 260)
• 14.3.1 Minimizing Quantization Errors (p. 261)
• 14.4 Fast Fourier Solutions (p. 262)
• 14.4.1 Some Brief Calculus (p. 264)
• 14.5 The Fast Fourier Transform (p. 265)
• 14.6 Hiding Information with FFTs and DCTs (p. 270)
• 14.6.1 Tweaking a Number of Coefficients (p. 271)
• 14.6.2 Removing the Original from the Detection Process (p. 274)
• 14.6.3 Tempering the Wake (p. 275)
• 14.7 Wavelets (p. 275)
• 14.8 Modifications (p. 278)
• 14.8.1 Identifying the Best Areas (p. 278)
• 14.8.2 Quantize the Coefficients to Hide Information (p. 278)
• 14.8.3 Hide the Information in the Phase (p. 279)
• 14.9 Summary (p. 280)
• 15 Synthetic Worlds: Slam Dunks (p. 281)
• 15.1 Created Worlds (p. 282)
• 15.2 Text Position Encoding and OCR (p. 284)
• 15.2.1 Positioning (p. 285)
• 15.2.2 MandelSteg and Secrets (p. 287)
• 15.3 Echo Hiding (p. 287)
• 15.4 Summary (p. 289)
• 16 Watermarks: A Patent for Watermarking Humans (p. 291)
• 16.1 Embedding Ownerships Information (p. 292)
• 16.1.1 Fragility (p. 294)
• 16.1.2 Continuity (p. 294)
• 16.1.3 Watermark Size (p. 295)
• 16.1.4 Blind Detection (p. 295)
• 16.1.5 Resistance to Multiple Watermarks (p. 295)
• 16.1.6 Accuracy (p. 296)
• 16.1.7 Fidelity (p. 296)
• 16.1.8 Resistance to Framing (p. 297)
• 16.1.9 Keying (p. 297)
• 16.2 A Basic Watermark (p. 297)
• 16.2.1 Choosing the Coefficients (p. 299)
• 16.3 An Averaging Watermark (p. 300)
• 16.3.1 Effects of Distortion (p. 301)
• 16.4 Summary (p. 302)
• 17 Steganalysis: Code Words (p. 303)
• 17.1 Finding Hidden Messages (p. 303)
• 17.2 Typical Approaches (p. 305)
• 17.3 Visual Attacks (p. 306)
• 17.3.1 Aural Attacks (p. 309)
• 17.4 Structural Attacks (p. 309)
• 17.5 Statistical Attacks (p. 311)
• 17.5.1 Sophisticated Statistics (p. 313)
• 17.6 Summary (p. 314)
• Afterword (p. 315)
• Appendix A Java Mimic Code (p. 319)
• Appendix B Baseball CFG (p. 353)
• Appendix C Reversible Grammar Generator (p. 367)
• Appendix D Software (p. 379)
• Further Readings (p. 383)
• Bibliography (p. 387)
• Index (p. 401)