دسترسی نامحدود
برای کاربرانی که ثبت نام کرده اند
برای ارتباط با ما می توانید از طریق شماره موبایل زیر از طریق تماس و پیامک با ما در ارتباط باشید
در صورت عدم پاسخ گویی از طریق پیامک با پشتیبان در ارتباط باشید
برای کاربرانی که ثبت نام کرده اند
درصورت عدم همخوانی توضیحات با کتاب
از ساعت 7 صبح تا 10 شب
ویرایش:
نویسندگان: Behrouz A. Forouzan
سری: McGraw-Hill Forouzan networking series
ISBN (شابک) : 9780071102230, 0071263616
ناشر: McGraw-Hill Higher Education
سال نشر: 2008
تعداد صفحات: 752
زبان: English
فرمت فایل : PDF (درصورت درخواست کاربر به PDF، EPUB یا AZW3 تبدیل می شود)
حجم فایل: 9 مگابایت
در صورت ایرانی بودن نویسنده امکان دانلود وجود ندارد و مبلغ عودت داده خواهد شد
در صورت تبدیل فایل کتاب Introduction to Cryptography and Network Security به فرمت های PDF، EPUB، AZW3، MOBI و یا DJVU می توانید به پشتیبان اطلاع دهید تا فایل مورد نظر را تبدیل نمایند.
توجه داشته باشید کتاب مقدمه ای بر رمزنگاری و امنیت شبکه نسخه زبان اصلی می باشد و کتاب ترجمه شده به فارسی نمی باشد. وبسایت اینترنشنال لایبرری ارائه دهنده کتاب های زبان اصلی می باشد و هیچ گونه کتاب ترجمه شده یا نوشته شده به فارسی را ارائه نمی دهد.
بهروز فروزان، نویسنده سرشناس، در این اولین نسخه جدید، از سبک نوشتاری در دسترس و رویکرد بصری خود برای سادهسازی مفاهیم دشوار رمزنگاری و امنیت شبکه استفاده میکند. در حالی که بسیاری از کتابهای امنیتی دانش تئوری اعداد و ریاضیات پیشرفته را فرض میکنند یا ایدههای عمدتاً نظری را ارائه میدهند، فروزان موضوعات امنیتی دشواری را از پایه ارائه میکند. مقدمهای ملایم بر مبانی نظریه اعداد در فصلهای آغازین ارائه شده است، و راه را برای دانشآموز برای حرکت به سمت موضوعات پیچیدهتر امنیتی و رمزنگاری هموار میکند. مفاهیم دشوار ریاضی در ضمیمه های پایان هر فصل سازماندهی شده است تا دانش آموزان ابتدا اصول را بیاموزند، سپس پیشینه فنی را اعمال کنند. صدها مثال، و همچنین برنامههای کاملاً کدگذاری شده، یک رویکرد عملی و عملی را تکمیل میکنند که دانشآموزان را تشویق میکند مطالبی را که میآموزند آزمایش کنند.
In this new first edition, well-known author Behrouz Forouzan uses his accessible writing style and visual approach to simplify the difficult concepts of cryptography and network security. While many security books assume knowledge of number theory and advanced math, or present mainly theoretical ideas, Forouzan presents difficult security topics from the ground up. A gentle introduction to the fundamentals of number theory is provided in the opening chapters, paving the way for the student to move on to more complex security and cryptography topics. Difficult math concepts are organized in appendices at the end of each chapter so that students can first learn the principles, then apply the technical background. Hundreds of examples, as well as fully coded programs, round out a practical, hands-on approach which encourages students to test the material they are learning.
Title Contents Chapter 1 Introduction 1.1 SECURITY GOALS Confidentiality Integrity Availability 1.2 ATTACKS Attacks Threatening Confidentiality Attacks Threatening Integrity Attacks Threatening Availability Passive Versus Active Attacks 1.3 SERVICES AND MECHANISM Security Services Security Mechanisms Relation between Services and Mechanisms 1.4 TECHNIQUES Cryptography Steganography 1.5 THE REST OF THE BOOK Part One: Symmetric-Key Encipherment Part Two: Asymmetric-Key Encipherment Part Three: Integrity, Authentication, and Key Management Part Four: Network Security 1.6 RECOMMENDED READING Books WebSites 1.7 KEY TERMS 1.8 SUMMARY 1.9 PRACTICE SET Review Questions Exercises Part 1 Symmetric-Key Encipherment Chapter 2 Mathematics of Cryptography 2.1 INTEGER ARITHMETIC Set of Integers 20 vii Binary Operations Integer Division Divisibility Linear Diophantine Equations 2.2 MODULAR ARITHMETIC Modulo Operator Set of Residues: Zn Congruence Operations in Zn Inverses Addition and Multiplication Tables Different Sets for Addition and Multiplication Two More Sets 2.3 MATRICES Definitions Operations and Relations Determinant Inverses Residue Matrices 2.4 LINEAR CONGRUENCE Single-Variable Linear Equations Set of Linear Equations 2.5 RECOMMENDED READING Books WebSites 2.6 KEY TERMS 2.7 SUMMARY 2.8 PRACTICE SET Review Questions Exercises Chapter 3 Traditional Symmetric-Key Ciphers 3.1 INTRODUCTION Kerckhoff’s Principle Cryptanalysis Categories of Traditional Ciphers 3.2 SUBSTITUTION CIPHERS Monoalphabetic Ciphers Polyalphabetic Ciphers 3.3 TRANSPOSITION CIPHERS Keyless Transposition Ciphers Keyed Transposition Ciphers Combining Two Approaches 3.4 STREAM AND BLOCK CIPHERS Stream Ciphers Block Ciphers Combination 3.5 RECOMMENDED READING Books WebSites 3.6 KEY TERMS 3.7 SUMMARY 3.8 PRACTICE SET Review Questions Exercises Chapter 4 Mathematics of Cryptography 4.1 ALGEBRAIC STRUCTURES Groups Ring Field Summary 4.2 GF(2n) FIELDS Polynomials Using a Generator Summary 4.3 RECOMMENDED READING Books WebSites 4.4 KEY TERMS 4.5 SUMMARY 4.6 PRACTICE SET Review Questions Exercises Chapter 5 Introduction to Modern Symmetric-Key Ciphers 5.1 MODERN BLOCK CIPHERS Substitution or Transposition Block Ciphers as Permutation Groups Components of a Modern Block Cipher S-Boxes Product Ciphers Two Classes of Product Ciphers Attacks on Block Ciphers 5.2 MODERN STREAM CIPHERS Synchronous Stream Ciphers Nonsynchronous Stream Ciphers 5.3 RECOMMENDED READING Books WebSites 5.4 KEY TERMS 5.5 SUMMARY 5.6 PRACTICE SET Review Questions Exercises Chapter 6 Data Encryption Standard (DES) 6.1 INTRODUCTION History Overview 6.2 DES STRUCTURE Initial and Final Permutations Rounds Cipher and Reverse Cipher Examples 6.3 DES ANALYSIS Properties Design Criteria DES Weaknesses 6.4 MULTIPLE DES Double DES Triple DES 6.5 SECURITY OF DES Brute-Force Attack Differential Cryptanalysis Linear Cryptanalysis 6.6 RECOMMENDED READING Books WebSites 6.7 KEY TERMS 6.8 SUMMARY 6.9 PRACTICE SET Review Questions Exercises Chapter 7 Advanced Encryption Standard (AES) 7.1 INTRODUCTION History Criteria Rounds Data Units Structure of Each Round 7.2 TRANSFORMATIONS Substitution Permutation Mixing Key Adding 7.3 KEY EXPANSION Key Expansion in AES-128 Key Expansion in AES-192 and AES-256 Key-Expansion Analysis 7.4 CIPHERS Original Design Alternative Design 7.5 EXAMPLES 7.6 ANALYSIS OF AES Security Implementation Simplicity and Cost 7.7 RECOMMENDED READING Books WebSites 7.8 KEY TERMS 7.9 SUMMARY 7.10 PRACTICE SET Review Questions Exercises Chapter 8 Encipherment Using Modern Symmetric-Key Ciphers 8.1 USE OF MODERN BLOCK CIPHERS Electronic Codebook (ECB) Mode Cipher Block Chaining (CBC) Mode Cipher Feedback (CFB) Mode Output Feedback (OFB) Mode Counter (CTR) Mode 8.2 USE OF STREAM CIPHERS RC4 A5/1 8.3 OTHER ISSUES Key Management Key Generation 8.4 RECOMMENDED READING Books WebSites 8.5 KEY TERMS 8.6 SUMMARY 8.7 PRACTICE SET Review Questions Exercises Part 2 Asymmetric-Key Encipherment Chapter 9 Mathematics of Cryptography 9.1 PRIMES Definition Cardinality of Primes Checking for Primeness Euler’s Phi-Function Fermat’s Little Theorem Euler’s Theorem Generating Primes 9.2 PRIMALITY TESTING Deterministic Algorithms Probabilistic Algorithms Recommended Primality Test 9.3 FACTORIZATION Fundamental Theorem of Arithmetic Factorization Methods Fermat Method Pollard p – 1 Method Pollard rho Method More Efficient Methods 9.4 CHINESE REMAINDER THEOREM Applications 9.5 QUADRATIC CONGRUENCE Quadratic Congruence Modulo a Prime Quadratic Congruence Modulo a Composite 9.6 EXPONENTIATION AND LOGARITHM Exponentiation Logarithm 9.7 RECOMMENDED READING Books WebSites 9.8 KEY TERMS 9.9 SUMMARY 9.10 PRACTICE SET Review Questions Exercises Chapter 10 Asymmetric-Key Cryptography 10.1 INTRODUCTION Keys General Idea Need for Both Trapdoor One-Way Function Knapsack Cryptosystem 10.2 RSA CRYPTOSYSTEM Introduction Procedure Some Trivial Examples Attacks on RSA Recommendations Optimal Asymmetric Encryption Padding (OAEP) Applications 10.3 RABIN CRYPTOSYSTEM Procedure Security of the Rabin System 10.4 ELGAMAL CRYPTOSYSTEM ElGamal Cryptosystem Procedure Proof Analysis Security of ElGamal Application 10.5 ELLIPTIC CURVE CRYPTOSYSTEMS Elliptic Curves over Real Numbers Elliptic Curves over GF( p) Elliptic Curves over GF(2n) Elliptic Curve Cryptography Simulating ElGamal 10.6 RECOMMENDED READING Books WebSites 10.7 KEY TERMS 10.8 SUMMARY 10.9 PRACTICE SET Review Questions Exercises Part 3 Integrity, Authentication, and Key Management Chapter 11 Message Integrity and Message Authentication 11.1 MESSAGE INTEGRITY Document and Fingerprint Message and Message Digest Difference Checking Integrity Cryptographic Hash Function Criteria 11.2 RANDOM ORACLE MODEL Pigeonhole Principle Birthday Problems Attacks on Random Oracle Model Attacks on the Structure 11.3 MESSAGE AUTHENTICATION Modification Detection Code Message Authentication Code (MAC) 11.4 RECOMMENDED READING Books WebSites 11.5 KEY TERMS 11.6 SUMMARY 11.7 PRACTICE SET Review Questions Exercises Chapter 12 Cryptographic Hash Functions 12.1 INTRODUCTION Iterated Hash Function Two Groups of Compression Functions 12.2 SHA-512 Introduction Compression Function Analysis 12.3 WHIRLPOOL Whirlpool Cipher Summary Analysis 12.4 RECOMMENDED READING Books WebSites 12.5 KEY TERMS 12.6 SUMMARY 12.7 PRACTICE SET Review Questions Exercises Chapter 13 Digital Signature 13.1 COMPARISON Inclusion Verification Method Relationship Duplicity 13.2 PROCESS Need for Keys Signing the Digest 13.3 SERVICES Message Authentication Message Integrity Nonrepudiation Confidentiality 13.4 ATTACKS ON DIGITAL SIGNATURE Attack Types Forgery Types 13.5 DIGITAL SIGNATURE SCHEMES RSA Digital Signature Scheme ElGamal Digital Signature Scheme Schnorr Digital Signature Scheme Digital Signature Standard (DSS) Elliptic Curve Digital Signature Scheme 13.6 VARIATIONS AND APPLICATIONS Variations Applications 13.7 RECOMMENDED READING Books WebSites 13.8 KEY TERMS 13.9 SUMMARY 13.10 PRACTICE SET Review Questions Exercises Chapter 14 Entity Authentication 14.1 INTRODUCTION Data-Origin Versus Entity Authentication Verification Categories Entity Authentication and Key Management 14.2 PASSWORDS Fixed Password One-Time Password 14.3 CHALLENGE-RESPONSE Using a Symmetric-Key Cipher Using Keyed-Hash Functions Using an Asymmetric-Key Cipher Using Digital Signature 14.4 ZERO-KNOWLEDGE Fiat-Shamir Protocol Feige-Fiat-Shamir Protocol Guillou-Quisquater Protocol 14.5 BIOMETRICS Components Enrollment Authentication Techniques Accuracy Applications 14.6 RECOMMENDED READING Books WebSites 14.7 KEY TERMS 14.8 SUMMARY 14.9 PRACTICE SET Review Questions Exercises Chapter 15 Key Management 15.1 SYMMETRIC-KEY DISTRIBUTION Key-Distribution Center: KDC Session Keys 15.2 KERBEROS Servers Operation Using Different Servers Kerberos Version 5 Realms 15.3 SYMMETRIC-KEY AGREEMENT Diffie-Hellman Key Agreement Station-to-Station Key Agreement 15.4 PUBLIC-KEY DISTRIBUTION Public Announcement Trusted Center Controlled Trusted Center Certification Authority X.509 Public-Key Infrastructures (PKI) 15.5 RECOMMENDED READING Books WebSites 15.6 KEY TERMS AND CONCEPTS 15.7 SUMMARY 15.8 PRACTICE SET Review Questions Exercises Part 4 Network Security Chapter 16 Security at the Application Layer: PGP and S/MIME 16.1 E-MAIL E-mail Architecture E-mail Security 16.2 PGP Scenarios Key Rings PGP Certificates Key Revocation Extracting Information from Rings PGP Packets PGP Messages Applications of PGP 16.3 S/MIME MIME S/MIME Applications of S/MIME 16.4 RECOMMENDED READING Books WebSites 16.5 KEY TERMS 16.6 SUMMARY 16.7 EXERCISES Review Questions Exercises Chapter 17 Security at the Transport Layer: SSL and TLS 17.1 SSL ARCHITECTURE Services Key Exchange Algorithms Encryption/Decryption Algorithms Hash Algorithms Cipher Suite Compression Algorithms Cryptographic Parameter Generation Sessions and Connections 17.2 FOUR PROTOCOLS Handshake Protocol ChangeCipherSpec Protocol Alert Protocol Record Protocol 17.3 SSL MESSAGE FORMATS ChangeCipherSpec Protocol Alert Protocol Handshake Protocol Application Data 17.4 TRANSPORT LAYER SECURITY Version Cipher Suite Generation of Cryptographic Secrets Alert Protocol Handshake Protocol Record Protocol 17.5 RECOMMENDED READING Books WebSites 17.6 KEY TERMS 17.7 SUMMARY 17.8 PRACTICE SET Review Questions Exercises Chapter 18 Security at the Network Layer: IPSec 18.1 TWO MODES Comparison 18.2 TWO SECURITY PROTOCOLS Authentication Header (AH) Encapsulating Security Payload (ESP) IPv4 and IPv6 AH versus ESP Services Provided by IPSec 18.3 SECURITY ASSOCIATION Idea of Security Association Security Association Database (SAD) 18.4 SECURITY POLICY Security Policy Database 18.5 INTERNET KEY EXCHANGE (IKE) Improved Diffie-Hellman Key Exchange IKE Phases Phases and Modes Phase I: Main Mode Phase I: Aggressive Mode Phase II: Quick Mode SA Algorithms 18.6 ISAKMP General Header Payloads 18.7 RECOMMENDED READING Books WebSites 18.8 KEY TERMS 18.9 SUMMARY 18.10 PRACTICE SET Review Questions Exercises Appendix A ASCII Appendix B Standards and Standard Organizations B.1 INTERNET STANDARDS Maturity Levels Requirement Levels Internet Administration B.2 OTHER STANDARD ORGANIZATIONS NIST ISO ITU-T ANSI IEEE EIA Appendix C TCP/IP Protocol Suite C.1 LAYERS IN THE TCP/IP Application Layer Transport Layer Network Layer Data Link Layer Physical Layer C.2 ADDRESSING Specific Address Port Address Logical Address Physical Address Appendix D Elementary Probability D.1 INTRODUCTION Definitions Probability Assignment Axioms Properties Conditional Probability D.2 RANDOM VARIABLES Continuous Random Variables Discrete Random Variables Appendix E Birthday Problems E.1 FOUR PROBLEMS First Problem Second Problem Third Problem Fourth Problem E.2 SUMMARY Appendix F Information Theory F.1 MEASURING INFORMATION F.2 ENTROPY Maximum Entropy Minimum Entropy Interpretation of Entropy Joint Entropy Conditional Entropy Other Relations Perfect Secrecy F.3 ENTROPY OF A LANGUAGE Entropy of an Arbitrary Language Entropy of the English Language Redundancy Unicity Distance Appendix G List of Irreducible and Primitive Polynomials Appendix H Primes Less Than 10,000 Appendix I Prime Factors of Integers Less Than 1000 Appendix J List of First Primitive Roots for Primes Less Than 1000 Appendix K Random Number Generator K.1 TRNG K.2 PRNG Congruential Generators Cryptosystem-Based Generators Appendix L Complexity L.1 COMPLEXITY OF AN ALGORITHM Bit-Operation Complexity L.2 COMPLEXITY OF A PROBLEM Two Broad Categories L.3 PROBABILISTIC ALGORITHMS Monte Carlo Algorithms Las Vegas Algorithms Appendix M ZIP M.1 LZ77 ENCODING Compression Decompression Appendix N Differential and Linear Cryptanalysis of DES N.1 DIFFERENTIAL CRYPTANALYSIS Probabilistic Relations Attack Finding the Cipher Key Security N.2 LINEAR CRYPTANALYSIS Linearity Relations Attack Security Appendix O Simplified DES (S-DES) O.1 S-DES STRUCTURE Initial and Final Permutations Rounds Key Generation O.2 CIPHER AND REVERSE CIPHER Appendix P Simplified AES (S-AES) P.1 S-AES STRUCTURE Rounds Data Units Structure of Each Round P.2 TRANSFORMATIONS Substitution Permutation Mixing Key Adding P.3 KEY EXPANSION Creation of Words in S-AES P.4 CIPHERS Appendix Q Some Proofs Q.1 CHAPTER 2 Divisibility Euclidean Algorithms Congruence Q.2 CHAPTER 9 Primes Euler’s Phi-Function Fermat’s Little Theorem Euler’s Theorem Fundamental Theorem of Arithmetic Glossary References Index