Information Security
0%
Course Title: Information Security
Course No: BIT303
Nature of the Course: Theory + Lab
Semester: 5
Full Marks: 60 + 20 + 20
Pass Marks: 24 + 8 + 8
Credit Hours: 3
Course Description
Course Objectives
Course Contents
1. Introduction
4 hrs
2.6. Mathematical Foundations for Asymmetric Encryption
- Prime Numbers, Fermat's Theorem
- Primality Testing: Miller-Rabin Algorithm
- Euclidean Algorithm, Extended Euclidean Algorithm
- Euler Totient Function
5. Access Control
5 hrs
Laboratory Works
- 1.Classical ciphers
- 2.DES and AES
- 3.Primality Testing, Euclidean Algorithms, Diffie-Hellman, RSA
- 4.MD5, SHA-1, SHA-2
- 5.Authentication systems
- 6.Access control and capability lists
- 7.Malicious Logics
- 8.Security policy and security audit case studies
Reference Books
- 1.William Stallings and Lawrie Brown, Computer Security: Principles and Practice, Pearson, Latest Edition
- 2.William Stallings, Cryptography and Network Security: Principles and Practice, Pearson
- 3.Mark Stamp, Information Security: Principles and Practices, Wiley
- 4.Matt Bishop, Introduction to Computer Security, Addison Wesley
- 5.Matt Bishop, Computer Security, Art and Science, Addison Wesley
- 6.Charles P. Pfleeger and Shari Lawrence Pfleeger, Security in Computing, Pearson
- 7.William Stallings, Information Privacy Engineering and Privacy by Design, Pearson