Salomon Data Privacy and Security

Erscheinungsjahr 2012
ISBN: 978-0-387-21707-9
Verlag: Springer US
Format: PDF
Kopierschutz: 1 - PDF Watermark

E-Book, Englisch, 465 Seiten, eBook

Covering classical cryptography, modern cryptography, and steganography, this volume details how data can be kept secure and private. Each topic is presented and explained by describing various methods, techniques, and algorithms. Moreover, there are numerous helpful examples to reinforce the reader's understanding and expertise with these techniques and methodologies.Features & Benefits:* Incorporates both data encryption and data hiding * Supplies a wealth of exercises and solutions to help readers readily understand the material* Presents information in an accessible, nonmathematical style* Concentrates on specific methodologies that readers can choose from and pursue, for their data-security needs and goals* Describes new topics, such as the advanced encryption standard (Rijndael), quantum cryptography, and elliptic-curve cryptography.The book, with its accessible style, is an essential companion for all security practitioners and professionals who need to understand and effectively use both information hiding and encryption to protect digital data and communications. It is also suitable for self-study in the areas of programming, software engineering, and security.

Zielgruppe

Professional/practitioner

Autoren/Hrsg.

Salomon, David

Inhaltsverzeichnis

Basic Concepts.- The Caesar Cipher.- The Affine Cipher.- The One-Time Pad.- Kerckhoffs’ Principle.- I. Data Encryption.- 1 Monoalphabetic Substitution Ciphers.- 2 Transposition Ciphers.- 3 Polyalphabetic Substitution Ciphers.- 4 Random Numbers.- 5 The Enigma.- 6 Stream Ciphers.- 7 Block Ciphers.- 8 Public-Key Cryptography.- 9 Quantum Cryptography.- II. Data Hiding.- 10 Data Hiding in Text.- 11 Data Hiding in Images.- 12 Data Hiding: Other Methods.- III. Essential Resources.- Appendixes.- A Convolution.- A.1 One-Dimensional Convolution.- A.2 Two-Dimensional Convolution.- B Hashing.- B.1 Hash Tables.- B.2 Hash Functions.- B.3 Collision Handling.- B.4 Secure Hash Functions.- C Cyclic Redundancy Codes.- D Galois Fields.- D.1 Field Definitions and Operations.- D.2 GF(256) and Rijndael.- D.3 Polynomial Arithmetic.- Answers to Exercises.- Cryptography Timeline.