Available:*
Library | Item Barcode | Call Number | Material Type | Item Category 1 | Status |
|---|---|---|---|---|---|
Searching... | 30000010023357 | QA76.9.A25 H47 2003 | Open Access Book | Book | Searching... |
On Order
Summary
Summary
Publisher's Note: Products purchased from Third Party sellers are not guaranteed by the publisher for quality, authenticity, or access to any online entitlements included with the product.
AN UNCONVENTIONAL, FUN WAY TO MASTER THE BASICS OF CRYPTOGRAPHY
Cryptography is not just for specialists. Now every wireless message, wireless phone call, online transaction, and email is encrypted at one end and decrypted at the other. "Crypto" is part of the job description for network designers, network engineers, and telecom developers. If you need cryptography basics--but dread the thick tomes that are your only other option--help is at hand. Cryptography Demystified puts the fundamentals into a 35-module, learn-by-doing package that's actually fun to use.
You must read this book if--
* You prefer your simplifications from an expert who understands the complexities
* 6 years of success as a short course for students and professionals works for you
* you enjoy hearing the phrase "nothing to memorize"
* ecommerce, email, network security, or wireless communications is part of your bailiwick
* cracking cryptography means a jump up the career ladder
* the words "public-key cryptography," "channel-based cryptography," and "prime numbers" pique your interest
* best-practices cryptography is the only secure way for you--and your company--to go
One of the most complex subjects in Information Technology, cryptography gets its due in this down-to-earth, self-teaching tutorial--the first to make the basics of the science truly accessible.
Author Notes
John E. Hershey has more than 30 years' experience in telecom security. The author or co-author of five advanced texts: Hadamard Matrix Analysis and Synthesis : With Applications to Communications and Signal/Image Processing; The Elements of System Design; Data Transportation and Protection (Applications of Communications Theory); Perspectives in Spread Spectrum; and Doppler Applications in LEO Satellite Communication Systems , he was elected a Fellow of the IEEE "for contributions to secure communications" and currently teaches cryptography at Rensselaer Polytechnic Institute in Troy, New York. He lives in Ballston Lake, New York.
Table of Contents
| Part I Introduction to Symmetric Cryptography | p. 1 |
| Module 1 First Considerations | p. 3 |
| Exercise 1 | p. 8 |
| Module 2 Plaintext | p. 11 |
| Exercise 2 | p. 17 |
| Module 3 Digitization of Plaintext | p. 21 |
| Exercise 3 | p. 29 |
| Module 4 Toward a Cryptographic Paradigm | p. 31 |
| Exercise 4 | p. 36 |
| Module 5 What We Want from the Keytext | p. 37 |
| Exercise 5 | p. 45 |
| Module 6 Randomness I | p. 49 |
| Exercise 6 | p. 57 |
| Module 7 Finite State Sequential Machines | p. 59 |
| Exercise 7 | p. 63 |
| Transition Matrix | p. 63 |
| Module 8 m-sequences | p. 67 |
| Exercise 8 | p. 72 |
| Module 9 The Paradigm Attempted | p. 75 |
| Exercise 9 | p. 81 |
| Module 10 The Block Cipher Function - A Modern Keystone to the Paradigm | p. 83 |
| Exercise 10 | p. 87 |
| Module 11 Confidentiality Modes: ECB and CTR | p. 89 |
| Exercise 11 | p. 95 |
| Module 12 Confidentiality Mode: Output Feedback (OFB) | p. 97 |
| Exercise 12 | p. 100 |
| Module 13 Confidentiality Modes: Cipher Feedback (CFB) and Cipher Block Chaining (CBC) | p. 101 |
| Exercise 13 | p. 107 |
| Part II Number Theory We Will Need | p. 109 |
| Module 14 Prime Numbers I | p. 111 |
| Exercise 14 | p. 117 |
| Module 15 Congruences | p. 119 |
| Exercise 15 | p. 124 |
| Module 16 Euler-Fermat Theorem | p. 125 |
| Exercise 16 | p. 130 |
| Module 17 The Euler Phi ([phi]) Function | p. 131 |
| Exercise 17 | p. 134 |
| Module 18 The Binary Exponentiation Algorithm | p. 135 |
| Exercise 18 | p. 138 |
| Module 19 The Extended Euclidean Algorithm | p. 139 |
| Exercise 19 | p. 143 |
| Module 20 Primitive Roots | p. 145 |
| Exercise 20 | p. 149 |
| Module 21 Chinese Remainder Theorem | p. 151 |
| Exercise 21 | p. 153 |
| Part III Introduction to Public Key Cryptography | p. 155 |
| Module 22 Merkle's Puzzle | p. 157 |
| Exercise 22 | p. 160 |
| Module 23 The Diffie-Hellman Public Key Cryptographic System | p. 161 |
| Exercise 23 | p. 166 |
| Module 24 Split Search | p. 167 |
| Exercise 24 | p. 171 |
| Module 25 A Variant of the Diffie-Hellman System | p. 173 |
| Exercise 25 | p. 181 |
| Module 26 The RSA Public Key Cryptographic System | p. 183 |
| Exercise 26 | p. 192 |
| Module 27 Prime Numbers II | p. 193 |
| Exercise 27 | p. 197 |
| Part IV Keying Variables | p. 199 |
| Module 28 Keying Variable Distribution | p. 201 |
| Exercise 28 | p. 206 |
| Module 29 Secret Sharing | p. 207 |
| Exercise 29 | p. 214 |
| Module 30 Randomness II | p. 215 |
| Exercise 30 | p. 223 |
| Module 31 Cryptovariables | p. 225 |
| Exercise 31 | p. 229 |
| Part V Crypto-Obsolescence | p. 233 |
| Module 32 The Aging Cryptoalgorithm | p. 235 |
| Exercise 32 | p. 245 |
| Module 33 Superdes | p. 247 |
| Exercise 33 | p. 257 |
| Part VI Channel-Based Cryptography | p. 259 |
| Module 34 The Channel Is the Cryptovariable | p. 261 |
| Exercise 34 | p. 267 |
| Module 35 The Quantum Cryptographic Channel | p. 269 |
| Exercise 35 | p. 281 |
| Answers to Exercises | p. 283 |
| Glossary | p. 343 |
| Index | p. 349 |
