Fifth Semester

 Selction Image

Cryptography

Course Title:Cryptography

Course No.: CSC316

Course Nature: Theory + Lab

Semester: Fifth

Year: Third

Full Marks: 60 + 20 + 20

Pass Marks: 24 + 8 + 8

Credit Hours: 3

Course Description: The course introduces the underlying the principles and design of cryptosystems. The course covers the basics concepts of cryptography including: traditional ciphers, block ciphers, stream ciphers, public and private key cryptosystems. The course also includes the theory of hash functions, authentication systems, network security protocols and malicious logic.

Course Objectives: The objectives of this course are to familiarize the students with cryptography and its applications. The students will be able to develop basic understanding of cryptographic mechanisms.

Contents of Chapter

Unit 1: Introduction and Classical Ciphers (7 hr)

1.1. Security: Computer Security, Information Security, Network Security, CIA Triad, Cryptography, Cryptosystem, Cryptanalysis, Security Threats and Attacks, Security Services, Security Mechanisms
1.2. Classical Cryptosystems: Substitution Techniques: Ceasar, Monoalphabetic, Playfair, Hill, Polyalphabetic ciphers, One-time pad Transposition Techniques: Rail Fence Cipher
1.3. Modern Ciphers: Block vs. Stream Ciphers, Symmetric vs. Asymmetric Ciphers

Unit 2: Symmetric Ciphers (10 hr.)

2.1. Fiestel Cipher Structure, Substitution Permutation Network (SPN)
2.2. Data Encryption Standards (DES), Double DES, Triple DES
2.3. Finite Fields: Groups Rings, Fields, Modular Arithmetic, Euclidean Algorithm, Galois Fields (GF(p) & GF(2n)), Polynomial Arithmetic
2.4. International Data Encryption Standard (IDEA)
2.5. Advanced Encryption Standards (AES) Cipher
2.6. Modes of Block Cipher Encryptions (Electronic Code Book, Cipher Block Chaining, Cipher Feedback Mode, Output Feedback Mode, Counter

Unit 3: Asymmetric Ciphers (8 hr)

3.1. Number Theory: Prime Numbers, Fermat’s Theorem, Euler’s Theorem, Primility Testing, Miller-Rabin Algorithm, Extended Euclidean Theorem, Discrete Logarithms
3.2. Public Key Cryptosystems, Applications of Public Key Cryptosystems
3.3. Distribution of public key, Distribution of secret key by using public key cryptography, DiffieHelman Key Exchange, Man-in-the-Middle Attack
3.4. RSA Algorithm
3.5. Elgamal Cryptographic System

Unit 4: Cryptographic Hash Functions and Digital Signatures (8 hr)

4.1. Message Authentication, Message Authentication Functions, Message Authentication Codes
4.2. Hash Functions, Properties of Hash functions, Applications of Hash Functions
4.3. Message Digests: MD4 and MD5
4.4. Secure Hash Algorithms: SHA-1 and SHA-2
4.5. Digital Signatures: Direct Digital Signatures, Arbitrated Digital Signature
4.6. Digital Signature Standard: The DSS Approach, Digital Signature Algorithm
4.7. Digital Signature Standard: The RSA Approach

Unit 5: Authentication (3 Hrs)

5.1. Authentication System,

5.5. Password Based Authentication, Dictionary Attacks,
5.2. Challenge Response System
5.3. Biometric System
5.4. Needham-Schroeder Scheme, Kerberos Protocol

Unit 6: Network Security and Public Key Infrastructure (6 Hrs)

6.1. Overview of Network Security
6.2. Digital Certificates and X.509 certificates, Certificate Life Cycle Management
6.3. PKI trust models, PKIX
6.4. Email Security: Pretty Good Privacy (PGP)
6.5. Secure Socket Layer (SSL) and Transport Layer Security (TLS)
6.6. IP Security (IPSec)
6.7. Firewalls and their types

Unit 7: Malicious Logic (3 Hrs)

7.1. Malicious Logic, Types of Malicious Logic: Virus, Worm, Trojan Horse, Zombies, Denial of Service Attacks,
7.2. Intrusion, Intruders and their types, Intrusion Detection System

Laboratory Works:

The laboratory work includes implementing and simulating the concepts of cryptographic algorithms, hash functions, digital signatures, network security protocols and malicious logic. Students are free to use any of the language and platform as per the skills.

Text Books:

  1. W. Stallings, Cryptography and Network Security, Pearson Education.

Reference Books:

  1. William Stallings, Network Security, Principles and Practice.
  2. Matt Bishop, Computer Security, Art and Science.
  3. Mark Stamp, Information Security: Principles and Practices.
  4. Bruce Schneier, Applied Cryptography.
  5. Douglas. R. Stinson. Cryptography: Theory and Practice.
  6. B. A. Forouzan, Cryptography & Network Security, Tata Mc Graw Hill.