Sisällysluettelo:
“…2.17 M/M/1 Queue -- 2.18 M/M/1 Queue With Bulk Arrivals/Service -- 2.18.1
Mx/M/1 (Bulk Arrivals) System -- 2.18.2 M/MY/1 (Bulk Service) System -- 2.18.3 M/M/1/k Queueing System -- 2.18.4 M/M/k Queueing System -- 2.18.5 M/M/∞ Queueing System -- 2.19 M/G/1 Queueing SYSTEM -- 2.20 M/Ek/1 Queueing SYSTEM -- 2.21 Networks of Queues -- 2.21.1 Tandem Queues -- 2.21.2 Queueing System with Splitting -- 2.21.3 Queueing System with Feedback -- 2.22 Jackson Networks -- 2.23 Exercises -- Chapter 3: Overview of Cryptography -- 3.1 Introduction -- 3.2 Basic Terms Related to Cryptography -- 3.2.1 Cryptographic Primitives -- 3.2.2 Cryptographic Protocols -- 3.2.3 Encryption (at the Sender's End) -- 3.2.4 Decryption (at the Recipient's End) -- 3.3 Requirements of Secure Communication -- 3.4 Osi Security Architecture X.800 -- 3.4.1 Security Attacks -- 3.4.2 Security Services -- 3.4.3 Security Mechanisms -- 3.5 Categories of Cryptographic Systems -- 3.6 Symmetric (or Conventional) Encryption Model -- 3.6.1 Types of Attacks on a Conventional Encryption Scheme -- 3.6.2 Conventional Encryption for Confidentiality -- 3.6.3 Link Encryption -- 3.7 Exercises -- Chapter 4: Mathematical Foundations for Cryptography -- 4.1 Introduction -- 4.2 Introduction to Groups, Rings, and Fields -- 4.2.1 Groups -- 4.2.2 Ring -- 4.2.3 Field -- 4.3 Modular Arithmetic -- 4.3.1 Residue Classes (mod n) -- 4.3.2 Properties of Zn -- 4.3.3 Multiplication within Set Zn -- 4.4 Introduction to
Primes and Co-
Primes -- 4.4.1
Prime Numbers -- 4.4.2 Co-
Prime Numbers or Relatively
Prime Numbers -- 4.5 Euclid's Algorithm To Determine GCD -- 4.6 Extended Euclid's Algorithm -- 4.7 Galols Finite Fields -- 4.7.1 GF (p) -- 4.7.2 Set Z*p -- 4.7.3 Galois Finite Fields of Order 2n -- 4.7.4 Arithmetic Operations within GF (2n) -- 4.7.5 Addition (+) Operation within GF (23) -- 4.7.6 Addition Inverse of GF (23)…”
Tallennettuna: