Cryptography Syllabus (CSC 316) – TU BSc CSIT 5th Semester

Tribhuvan University
Institute of Science and Technology
Bachelor of Science in Computer Science and Information Technology

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

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

Course Contents

Unit 1. Introduction and Classical Ciphers (7 Hrs.)

• 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: Caesar, 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 Hrs.)

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

Unit 3. Asymmetric Ciphers (8 Hrs.)

• 3.1 Number Theory: Prime Numbers, Fermat’s Theorem, Euler’s Theorem, Primality 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, Diffie-Hellman 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 Hrs.)

• 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.2 Password Based Authentication, Dictionary Attacks
• 5.3 Challenge Response System
• 5.4 Biometric System
• 5.5 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 language and platform as per their skills.

Text Books

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

Reference Books

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