Autore	Stamp Mark
Pubbl/distr/stampa	Hoboken, New Jersey : , : Wiley-Interscience, , c2007
Descrizione fisica	1 online resource (424 p.)
Disciplina	005.82
Altri autori (Persone)	LowRichard M. <1967->
Soggetto topico	Computer security Data encryption (Computer science) Cryptography
ISBN	1-280-90120-9 9786610901203 0-470-14877-2 0-470-14876-4
Formato	Materiale a stampa
Livello bibliografico	Monografia
Lingua di pubblicazione	eng
Nota di contenuto	Preface -- About The Authors -- Acknowledgments -- 1. Classic Ciphers -- 1.1 Introduction -- 1.2 Good Guys and Bad Guys -- 1.3 Terminology -- 1.4 Selected Classic Crypto Topics -- 1.4.1 Transposition Ciphers -- 1.4.2 Substitution Ciphers -- 1.4.3 One-Time Pad -- 1.4.4 Codebook Ciphers -- 1.5 Summary -- 1.6 Problems -- 2. World War II Ciphers -- 2.1 Introduction -- 2.2 Enigma -- 2.2.1 Enigma Cipher Machine -- 2.2.2 Enigma Keyspace -- 2.2.3 Rotors -- 2.2.4 Enigma Attack -- 2.2.5 More Secure Enigma -- 2.3 Purple -- 2.3.1 Purple Cipher Machine -- 2.3.2 Purple Keyspace -- 2.3.3 Purple Diagnosis -- 2.3.4 Decrypting Purple -- 2.3.5 Purple versus Enigma -- 2.4 Sigaba -- 2.4.1 Sigaba Cipher Machine -- 2.4.2 Sigaba Keyspace -- 2.4.3 Sigaba Attack -- 2.4.4 Sigaba Conclusion -- 2.5 Summary -- 2.6 Problems -- 3. Stream Ciphers -- 3.1 Introduction -- 3.2 Shift Registers -- 3.2.1 Berlekamp-Massey Algorithm -- 3.2.2 Cryptographically Strong Sequences -- 3.2.3 Shift Register-Based Stream Ciphers -- 3.2.4 Correlation Attack -- 3.3 ORYX -- 3.3.1 ORYX Cipher -- 3.3.2 ORYX Attack -- 3.3.3 Secure ORYX -- 3.4 RC4 -- 3.4.1 RC4 Algorithm -- 3.4.2 RC4 Attack -- 3.4.3 Preventing the RC4 Attack -- 3.5 PKZIP -- 3.5.1 PKZIP Cipher -- 3.5.2 PKZIP Attack -- 3.5.3 Improved PKZIP -- 3.6 Summary -- 3.7 Problems -- 4. Block Ciphers -- 4.1 Introduction -- 4.2 Block Cipher Modes -- 4.3 Feistel Cipher -- 4.4 Hellman's Time-Memory Trade-Off -- 4.4.1 Cryptanalytic TMTO -- 4.4.2 Bad Chains -- 4.4.3 Success Probability -- 4.4.4 Distributed TMTO -- 4.4.5 TMTO Conclusions -- 4.5 CMEA -- 4.5.1 CMEA Cipher -- 4.5.2 SCMEA Cipher -- 4.5.3 SCMEA Chosen Plaintext Attack -- 4.5.4 CMEA Chosen Plaintext Attack -- 4.5.5 SCMEA Known Plaintext Attack -- 4.5.6 CMEA Known Plaintext Attack -- 4.5.7 More Secure CMEA -- 4.6 Akelarre -- 4.6.1 Akelarre Cipher. 4.6.2 Akelarre Attack -- 4.6.3 Improved Akelarre? -- 4.7 FEAL -- 4.7.1 FEAL-4 Cipher -- 4.7.2 FEAL-4 Differential Attack -- 4.7.3 FEAL-4 Linear Attack -- 4.7.4 Confusion and Diffusion -- 4.8 Summary -- 4.9 Problems -- 5. Hash Functions -- 5.1 Introduction -- 5.2 Birthdays and Hashing -- 5.2.1 The Birthday Problem -- 5.2.2 Birthday Attacks on Hash Functions -- 5.2.3 Digital Signature Birthday Attack -- 5.2.4 Nostradamus Attack -- 5.3 MD4 -- 5.3.1 MD4 Algorithm -- 5.3.2 MD4 Attack -- 5.3.3 A Meaningful Collision -- 5.4 MD5 -- 5.4.1 MD5 Algorithm -- 5.4.2 A Precise Differential -- 5.4.3 Outline of Wang?s Attack -- 5.4.4 Wang's MD5 Differentials -- 5.4.5 Reverse Engineering Wang's Attack -- 5.4.6 Stevens' Attack -- 5.4.7 A Practical Attack -- 5.5 Summary -- 5.6 Problems -- 6. Public Key Systems -- 6.1 Introduction -- 6.2 Merkle-Hellman Knapsack -- 6.2.1 Lattice-Reduction Attack -- 6.2.2 Knapsack Conclusion -- 6.3 Diffie-Hellman Key Exchange -- 6.3.1 Man-in-the-Middle Attack -- 6.3.2 Diffie-Hellman Conclusion -- 6.4 Arithmetica Key Exchange -- 6.4.1 Hughes-Tannenbaum Length Attack -- 6.4.2 Arithmetica Conclusion -- 6.5 RSA -- 6.5.1 Mathematical Issues -- 6.5.2 RSA Conclusion -- 6.6 Rabin Cipher -- 6.6.1 Chosen Ciphertext Attack -- 6.6.2 Rabin Cryptosystem Conclusion -- 6.7 NTRU Cipher -- 6.7.1 Meet-in-the-Middle Attack -- 6.7.2 Multiple Transmission Attack -- 6.7.3 Chosen Ciphertext Attack -- 6.7.4 NTRU Conclusion -- 6.8 ElGamal Signature Scheme -- 6.8.1 Mathematical Issues -- 6.8.2 ElGamal Signature Conclusion -- 6.9 Summary -- 6.10 Problems -- 7. Public Key Attacks -- 7.1 Introduction -- 7.2 Factoring Algorithms -- 7.2.1 Trial Division -- 7.2.2 Dixon's Algorithm -- 7.2.3 Quadratic Sieve -- 7.2.4 Factoring Conclusions -- 7.3 Discrete Log Algorithms -- 7.3.1 Trial Multiplication -- 7.3.2 Baby-Step Giant-Step -- 7.3.3 Index Calculus. 7.3.4 Discrete Log Conclusions -- 7.4 RSA Implementation Attacks -- 7.4.1 Timing Attacks -- 7.4.2 Glitching Attack -- 7.4.3 Implementation Attacks Conclusions -- 7.5 Summary -- 7.6 Problems -- Appendix -- A-1 MD5 Tables -- A-2 Math -- A-2.1 Number Theory -- A-2.2 Group Theory -- A-2.3 Ring Theory -- A-2.4 Linear Algebra -- Annotated Bibliography -- Index.
Record Nr.	UNINA-9910143721303321

Autore	Stamp Mark
Edizione	[2nd ed.]
Pubbl/distr/stampa	Hoboken, NJ, : Wiley, c2011
Descrizione fisica	1 online resource (608 p.)
Disciplina	005.8
Soggetto topico	Computer security Data protection
Soggetto genere / forma	Electronic books.
ISBN	1-283-13887-5 9786613138873 1-118-02796-5 1-118-02797-3 1-118-02795-7
Classificazione	COM053000
Formato	Materiale a stampa
Livello bibliografico	Monografia
Lingua di pubblicazione	eng
Nota di contenuto	Information Security: Principles and Practice; Contents; Preface; About The Author; Acknowledgments; 1 Introduction; 1.1 The Cast of Characters; 1.2 Alice's Online Bank; 1.2.1 Confidentiality, Integrity, and Availability; 1.2.2 Beyond CIA; 1.3 About This Book; 1.3.1 Cryptography; 1.3.2 Access Control; 1.3.3 Protocols; 1.3.4 Software; 1.4 The People Problem; 1.5 Principles and Practice; 1.6 Problems; I Crypto; 2 Crypto Basics; 2.1 Introduction; 2.2 How to Speak Crypto; 2.3 Classic Crypto; 2.3.1 Simple Substitution Cipher; 2.3.2 Cryptanalysis of a Simple Substitution; 2.3.3 Definition of Secure 2.3.4 Double Transposition Cipher2.3.5 One-Time Pad; 2.3.6 Project VENONA; 2.3.7 Codebook Cipher; 2.3.8 Ciphers of the Election of 1876; 2.4 Modern Crypto History; 2.5 A Taxonomy of Cryptography; 2.6 A Taxonomy of Cryptanalysis; 2.7 Summary; 2.8 Problems; 3 Symmetric Key Crypto; 3.1 Introduction; 3.2 Stream Ciphers; 3.2.1 A5/1; 3.2.2 RC4; 3.3 Block Ciphers; 3.3.1 Feistel Cipher; 3.3.2 DES; 3.3.3 Triple DES; 3.3.4 AES; 3.3.5 Three More Block Ciphers; 3.3.6 TEA; 3.3.7 Block Cipher Modes; 3.4 Integrity; 3.5 Summary; 3.6 Problems; 4 Public Key Crypto; 4.1 Introduction; 4.2 Knapsack; 4.3 RSA 4.3.1 Textbook RSA Example4.3.2 Repeated Squaring; 4.3.3 Speeding Up RSA; 4.4 Diffie-Hellman; 4.5 Elliptic Curve Cryptography; 4.5.1 Elliptic Curve Math; 4.5.2 ECC Diffie-Hellman; 4.5.3 Realistic Elliptic Curve Example; 4.6 Public Key Notation; 4.7 Uses for Public Key Crypto; 4.7.1 Confidentiality in the Real World; 4.7.2 Signatures and Non-repudiation; 4.7.3 Confidentiality and Non-repudiation; 4.8 Public Key Infrastructure; 4.9 Summary; 4.10 Problems; 5 Hash Functions++; 5.1 Introduction; 5.2 What is a Cryptographic Hash Function?; 5.3 The Birthday Problem; 5.4 A Birthday Attack 5.5 Non-Cryptographic Hashes5.6 Tiger Hash; 5.7 HMAC; 5.8 Uses for Hash Functions; 5.8.1 Online Bids; 5.8.2 Spam Reduction; 5.9 Miscellaneous Crypto-Related Topics; 5.9.1 Secret Sharing; 5.9.2 Random Numbers; 5.9.3 Information Hiding; 5.10 Summary; 5.11 Problems; 6 Advanced Cryptanalysis; 6.1 Introduction; 6.2 Enigma; 6.2.1 Enigma Cipher Machine; 6.2.2 Enigma Keyspace; 6.2.3 Rotors; 6.2.4 Enigma Attack; 6.3 RC4 as Used in WEP; 6.3.1 RC4 Algorithm; 6.3.2 RC4 Cryptanalytic Attack; 6.3.3 Preventing Attacks on RC4; 6.4 Linear and Differential Cryptanalysis; 6.4.1 Quick Review of DES 6.4.2 Overview of Differential Cryptanalysis6.4.3 Overview of Linear Cryptanalysis; 6.4.4 Tiny DES; 6.4.5 Differential Cryptanalysis of TDES; 6.4.6 Linear Cryptanalysis of TDES; 6.4.7 Implications Block Cipher Design; 6.5 Lattice Reduction and the Knapsack; 6.6 RSA Timing Attacks; 6.6.1 A Simple Timing Attack; 6.6.2 Kocher's Timing Attack; 6.7 Summary; 6.8 Problems; II Access Control; 7 Authentication; 7.1 Introduction; 7.2 Authentication Methods; 7.3 Passwords; 7.3.1 Keys Versus Passwords; 7.3.2 Choosing Passwords; 7.3.3 Attacking Systems via Passwords; 7.3.4 Password Verification 7.3.5 Math of Password Cracking
Record Nr.	UNINA-9910139648303321