ENGLISH

Cryptography Engineering: Design Principles and Practical Applications

By Bruce Schneier; Niels Ferguson; Tadayoshi Kohno

Book information

Publisher
Inc., Wiley Publishing
Year
2010
ISBN
978-0-470-47424-2
Language
english
Format
PDF
Filesize
3 MB (2918332 bytes)
Pages
385\385
Time added
2018-12-07 03:20:15

Description

Cryptography Engineering: Design Principles and Practical Applications......Page 5 Credits......Page 8 About the Authors......Page 9 Acknowledgments for Cryptography Engineering......Page 11 Acknowledgments for Practical Cryptography (the 1st Edition)......Page 12 Contents at a Glance......Page 13 Contents......Page 15 Preface to Cryptography Engineering......Page 25 Example Syllabi......Page 26 Additional Information......Page 28 Preface to Practical Cryptography (the 1st Edition)......Page 29 How to Read this Book......Page 31 In This Part......Page 33 Chapter 1: The Context of Cryptography......Page 35 1.1: The Role of Cryptography......Page 36 1.2: The Weakest Link Property......Page 37 1.3: The Adversarial Setting......Page 39 1.4: Professional Paranoia......Page 40 1.4.2: Discussing Attacks......Page 41 1.5: Threat Model......Page 42 1.6: Cryptography Is Not the Solution......Page 44 1.8: Cryptography Is the Easy Part......Page 45 1.10.1: Security Versus Performance......Page 46 1.10.3: Security Versus Evolving Systems......Page 49 1.12: Exercises for Professional Paranoia......Page 50 1.12.1: Current Event Exercises......Page 51 1.12.2: Security Review Exercises......Page 52 1.13: General Exercises......Page 53 2.1: Encryption......Page 55 2.1.1: Kerckhoffs' Principle......Page 56 2.2: Authentication......Page 57 2.3: Public-Key Encryption......Page 59 2.5: PKI......Page 61 2.6.2: The Known-Plaintext Model......Page 63 2.6.5: The Distinguishing Attack Goal......Page 64 2.7.1: Birthday Attacks......Page 65 2.7.2: Meet-in-the-Middle Attacks......Page 66 2.8: Security Level......Page 68 2.10: Complexity......Page 69 2.11: Exercises......Page 70 Part II: Message Security......Page 73 3.1: What Is a Block Cipher?......Page 75 3.2: Types of Attack......Page 76 3.4: Definition of Block Cipher Security......Page 78 3.4.1: Parity of a Permutation......Page 81 3.5: Real Block Ciphers......Page 82 3.5.1: DES......Page 83 3.5.2: AES......Page 86 3.5.3: Serpent......Page 88 3.5.4: Twofish......Page 89 3.5.5: Other AES Finalists......Page 90 3.5.6: Which Block Cipher Should I Choose?......Page 91 3.5.7: What Key Size Should I Use?......Page 92 3.6: Exercises......Page 93 Chapter 4: Block Cipher Modes......Page 95 4.1: Padding......Page 96 4.3: CBC......Page 97 4.3.3: Random IV......Page 98 4.3.4: Nonce-Generated IV......Page 99 4.4: OFB......Page 100 4.5: CTR......Page 102 4.7: Which Mode Should I Use?......Page 103 4.8: Information Leakage......Page 104 4.8.1: Chances of a Collision......Page 105 4.8.2: How to Deal With Leakage......Page 106 4.9: Exercises......Page 107 Chapter 5: Hash Functions......Page 109 5.1: Security of Hash Functions......Page 110 5.2: Real Hash Functions......Page 111 5.2.1: A Simple But Insecure Hash Function......Page 112 5.2.2: MD5......Page 113 5.2.4: SHA-224, SHA-256, SHA-384, and SHA-512......Page 114 5.3.1: Length Extensions......Page 115 5.4: Fixing the Weaknesses......Page 116 5.4.2: A More Efficient Short-term Fix......Page 117 5.6: Exercises......Page 119 6.1: What a MAC Does......Page 121 6.2: The Ideal MAC and MAC Security......Page 122 6.3: CBC-MAC and CMAC......Page 123 6.4: HMAC......Page 125 6.5: GMAC......Page 126 6.7: Using a MAC......Page 127 6.8: Exercises......Page 129 7.1.1: Roles......Page 131 7.1.3: Messages or Stream......Page 132 7.1.4: Security Properties......Page 133 7.2: Order of Authentication and Encryption......Page 134 7.3: Designing a Secure Channel: Overview......Page 136 7.3.1: Message Numbers......Page 137 7.3.3: Encryption......Page 138 7.4.1: Initialization......Page 139 7.4.2: Sending a Message......Page 140 7.4.3: Receiving a Message......Page 141 7.4.4: Message Order......Page 143 7.5: Alternatives......Page 144 7.6: Exercises......Page 145 Chapter 8: Implementation Issues (I)......Page 147 8.1: Creating Correct Programs......Page 148 8.1.1: Specifications......Page 149 8.1.2: Test and Fix......Page 150 8.1.4: So How Do We Proceed?......Page 151 8.3: Keeping Secrets......Page 152 8.3.1: Wiping State......Page 153 8.3.2: Swap File......Page 154 8.3.3: Caches......Page 156 8.3.4: Data Retention by Memory......Page 157 8.3.6: Data Integrity......Page 159 8.4: Quality of Code......Page 160 8.4.2: Modularization......Page 161 8.4.3: Assertions......Page 162 8.4.5: Testing......Page 163 8.5: Side-Channel Attacks......Page 164 8.7: Exercises......Page 165 Part III: Key Negotiation......Page 167 Chapter 9: Generating Randomness......Page 169 9.1: Real Random......Page 170 9.1.1: Problems With Using Real Random Data......Page 171 9.1.3: Real Random Data and PRNGS......Page 172 9.2: Attack Models for a PRNG......Page 173 9.3: Fortuna......Page 174 9.4: The Generator......Page 175 9.4.2: Reseed......Page 177 9.4.4: Generate Random Data......Page 178 9.5.1: Entropy Sources......Page 179 9.5.2: Pools......Page 180 9.5.3.1: Distribution of Events Over Pools......Page 182 9.5.3.2: Running Time of Event Passing......Page 183 9.5.4: Initialization......Page 184 9.5.5: Getting Random Data......Page 185 9.5.6: Add an Event......Page 186 9.6: Seed File Management......Page 187 9.6.2: Update Seed File......Page 188 9.6.4: Backups and Virtual Machines......Page 189 9.6.6: First Boot......Page 190 9.7: Choosing Random Elements......Page 191 9.8: Exercises......Page 193 10.1: Divisibility and Primes......Page 195 10.2: Generating Small Primes......Page 198 10.3: Computations Modulo a Prime......Page 199 10.3.1: Addition and Subtraction......Page 200 10.3.3: Groups and Finite Fields......Page 201 10.3.4: The GCD Algorithm......Page 202 10.3.5: The Extended Euclidean Algorithm......Page 203 10.3.6: Working Modulo 2......Page 204 10.4: Large Primes......Page 205 10.4.1: Primality Testing......Page 208 10.4.2: Evaluating Powers......Page 210 10.5: Exercises......Page 211 Chapter 11: Diffie-Hellman......Page 213 11.1: Groups......Page 214 11.2: Basic DH......Page 215 11.3: Man in the Middle......Page 216 11.4: Pitfalls......Page 217 11.5: Safe Primes......Page 218 11.6: Using a Smaller Subgroup......Page 219 11.7: The Size of p......Page 220 11.8: Practical Rules......Page 222 11.9: What Can Go Wrong?......Page 223 11.10: Exercises......Page 225 12.1: Introduction......Page 227 12.2.1: Garner's Formula......Page 228 12.2.2: Generalizations......Page 229 12.2.3: Uses......Page 230 12.3: Multiplication Modulo n......Page 231 12.4.1: Digital Signatures with RSA......Page 232 12.4.2: Public Exponents......Page 233 12.4.3: The Private Key......Page 234 12.4.5: Generating RSA Keys......Page 235 12.5: Pitfalls Using RSA......Page 237 12.6: Encryption......Page 238 12.7: Signatures......Page 241 12.8: Exercises......Page 243 13.1: Roles......Page 245 13.2: Trust......Page 246 13.3: Incentive......Page 247 13.4: Trust in Cryptographic Protocols......Page 249 13.5: Messages and Steps......Page 250 13.5.2: Protocol and Message Identity......Page 251 13.5.3: Message Encoding and Parsing......Page 252 13.5.5: Errors......Page 253 13.5.6: Replay and Retries......Page 255 13.6: Exercises......Page 257 14.1: The Setting......Page 259 14.2: A First Try......Page 260 14.3: Protocols Live Forever......Page 261 14.4: An Authentication Convention......Page 262 14.5: A Second Attempt......Page 263 14.6: A Third Attempt......Page 264 14.7: The Final Protocol......Page 265 14.8.1: Alice's View......Page 267 14.8.3: Attacker's View......Page 268 14.9: Computational Complexity of the Protocol......Page 270 14.9.1: Optimization Tricks......Page 271 14.10: Protocol Complexity......Page 272 14.13: Exercises......Page 273 15.1: Large Integer Arithmetic......Page 275 15.1.1: Wooping......Page 277 15.1.3: Checking RSA Encryption......Page 280 15.2: Faster Multiplication......Page 281 15.3: Side-Channel Attacks......Page 282 15.3.1: Countermeasures......Page 283 15.4: Protocols......Page 284 15.4.2: Receiving a Message......Page 285 15.5: Exercises......Page 287 Part IV: Key Management......Page 289 16.1.1: Expiration......Page 291 16.1.4: Real-Time Transactions......Page 292 16.2: Using the Real-Time Clock Chip......Page 293 16.3.2: Stopping the Clock......Page 294 16.3.3: Setting the Clock Forward......Page 295 16.4: Creating a Reliable Clock......Page 296 16.5: The Same-State Problem......Page 297 16.6: Time......Page 298 16.8: Exercises......Page 299 Chapter 17: Key Servers......Page 301 17.2: Kerberos......Page 302 17.3: Simpler Solutions......Page 303 17.3.3: Rekeying......Page 304 17.4: What to Choose......Page 305 17.5: Exercises......Page 306 18.1: A Very Short PKI Overview......Page 307 18.2.3: Electronic Banking......Page 308 18.3.1: Multilevel Certificates......Page 309 18.3.2: Expiration......Page 310 18.3.3: Separate Registration Authority......Page 311 18.5: Exercises......Page 312 19.1: Names......Page 313 19.2: Authority......Page 315 19.3: Trust......Page 316 19.4: Indirect Authorization......Page 317 19.6: Credential Systems......Page 318 19.7: The Modified Dream......Page 320 19.8.1: Revocation List......Page 321 19.8.2: Fast Expiration......Page 322 19.8.4: Revocation Is Required......Page 323 19.9: So What Is a PKI Good For?......Page 324 19.10: What to Choose......Page 325 19.11: Exercises......Page 326 20.1.1: Permission Language......Page 327 20.1.2: The Root Key......Page 328 20.2: The Life of a Key......Page 329 20.3: Why Keys Wear Out......Page 330 20.5: Exercises......Page 332 21.1: Disk......Page 333 21.2: Human Memory......Page 334 21.2.1: Salting and Stretching......Page 336 21.4: Secure Token......Page 338 21.5: Secure UI......Page 339 21.6: Biometrics......Page 340 21.7: Single Sign-On......Page 341 21.9: Secret Sharing......Page 342 21.10.1: Paper......Page 343 21.10.2: Magnetic Storage......Page 344 21.11: Exercises......Page 345 Part V: Miscellaneous......Page 347 22.1.1: The Standards Process......Page 349 22.1.1.2: Functionality......Page 351 22.1.2: SSL......Page 352 22.1.3: AES: Standardization by Competition......Page 353 22.2: Patents......Page 354 Chapter 23: Involving Experts......Page 355 Bibliography......Page 359 Index......Page 371

Similar books

Session C11: Ancient Cultural Landscapes in South Europe – their Ecological Setting and Evolution, Session C22: Gardeners from South America, Session S04: Agro-Pastoralism and Early Metallurgy Sessions, Session WS29: The Idea of Enclosure in Recent Iberian Prehistory, Session C88: Rhytmes et causalites des dynamiques de l'anthropisation en Europe entre 6500 ET 500 BC: Hypotheses socio-culturelles et/ou climatiques: Proceedings of the XV UISPP World Congress (Lisbon 4-9 September 2006) / Actes du XV Congrès Mondial (Lisbonne 4-9 Septembre 2006) Vol.36

2010 · PDF

THE BRITISH ARMY IN INDIA: ITS PRESERVATION BY AN APPROPRIATE CLOTHING, HOUSING, LOCATING, RECREATIVE EMPLOYMENT, AND HOPEFUL ENCOURAGEMENT OF THE TROOPS. with AN APPENDIX ON INDIA : THE CLIMATE OP ITS HILLS ; THE DEVELOPMENT OF ITS RESODRCBS, INDUSTRY, AND ARTS ; THE ADMINISTRATION OF JUSTICE ; THE BLACK ACT ; THE PROGRESS OF CHRISTIANITY ; THE TRAFFIC IN OPIUM ; THE VALUE OF INDIA ; PERMANENT CAUSES OF DISAFFECTION, AND OF THE RECENT REBELLION ; THE TRADITIONARY POLICY; MISGOVERNMENT BY NATIVE RULERS ; ANNEXATIONS OF THEIR TERRITORY, ETC.

1858 · PDF

Idries Shah 27 Books Collection : A Perfumed Scorpion, A Veiled Gazelle, Caravan of Dreams, Darkest England, Destination Mecca, Evenings with Idries Shah, Knowing How to Know, Learning How to Learn, Letters and Lectures of Idries Shah, Neglected aspects of Sufi study, Observations, Oriental Magic, Reflections, Seeker after Truth, Special Illumination, Special Problems in the study of Sufi ideas, Sufi thought and action, Tales of the Dervishes, The Dermis Probe, The Elephant in the Dark, The Englishman Handbook, Idries Shah Antology, The Magic Monastery, The natives are restless, wisdom of the Idiots PDF.

2022 · PDF

The travels of Capts. Lewis and Clarke from St. Louis, by way of the Missouri and Columbia rivers, to the Pacific ocean; performed in the years 1804, 1805 & 1806, by order of the government of the United States. Containing delineations of the manners, customs, religion, &c. of the Indians, comp. from various authentic sources, and original documents, and a summary of the Statistical view of the Indian nations, from the official communication of Meriwether Lewis. Illustrated with a map of the country, inhabited by the western tribes of Indians

1809 · PDF

Professional Linux kernel architecture ''Wrox programmer to programmer''--Cover. - ''What you are reading right now is the result of an evolution over more than seven years: After two years of writing, the first edition was published in German by Carl Hanser Verlag in 2003. It then described kernel 2.6.0. The test was used as a basis for the low-level design documentation for the EAL4+ security evaluation of Red Hat Enterprise Linux 5, requiring to update it to kernel 2.6.18 (if the EAL acronym does not mean anything to you, then Wikipedia is once more your friend). Hewlett-Packard sponsored the translation into English and has, thankfully, granted the rights to publish the result. Updates to kernel 2.6.24 were then performed specifically for this book''--P. ix

2008 · PDF