Course Title: Cryptography
Course No: CSC316
Nature of the Course: Theory + Lab
Semester: V
Full Marks: 60 + 20 + 20
Pass Marks: 24 + 8 + 8
Credit Hrs: 3
The course introduces the underlying principles and design of cryptosystems. It covers the basics 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.
The objectives of this course are to familiarize the students with cryptography and its applications. The students will develop a basic understanding of cryptographic mechanisms.
- Security: Computer Security, Information Security, Network Security, CIA Triad: Confidentiality, Integrity, Availability, Cryptography, Cryptosystem, Cryptanalysis, Security Threats, Attacks: Passive, Active, Security Services, Mechanisms, Policy and Mechanism.
- Classical Cryptosystems: Hierarchy of cipher, Substitution Techniques (Monoalphabetic, Polyalphabetic), Transposition Techniques.
- Modern Ciphers: Block Ciphers, Stream Ciphers, Symmetric Ciphers, Asymmetric Ciphers.
- Fiestel Cipher Structure, Substitution Permutation Network (SPN).
- Data Encryption Standards (DES): Key Generation, Encryption, Decryption Process, Weak Keys, Double DES, Meet in Middle Attack, Triple DES.
- Finite Fields: Groups, Rings, Fields, GCD, Euclidean Algorithm, Modular Arithmetic, Set of Residue (Zn), Congruence, Residue classes, Quadratic residue, Polynomial Arithmetic over Galois Field.
- International Data Encryption Standard (IDEA): Key Generation, Encryption, Decryption Process.
- Advanced Encryption Standards (AES): Key Generation, Encryption, Decryption Process.
- Modes of Block Cipher Encryptions: ECB, CBC, CFB, OFB, CTR.
- Number Theory: Prime Numbers, Primality Testing, Miller-Rabin Algorithm, Fermat’s Theorem, Euler’s Totient Function, Euler’s Theorem, Primitive Root, Discrete Logarithms.
- Public Key Cryptosystems, Applications, Distribution of Public Key, Diffie-Hellman Key Exchange, Man-in-the-Middle Attack.
- RSA Algorithm: Key Generation, Encryption, Decryption Process.
- Elgamal Cryptographic System: Key Generation, Encryption, Decryption Process.
- Message Authentication, Authentication Functions, Authentication Codes.
- Hash Functions: Properties, Applications.
- Message Digests: MD4, MD5 algorithms.
- Secure Hash Algorithms: SHA-1, SHA-2, SHA-512.
- Digital Signatures: Direct, Arbitrated Digital Signature, DSS Approach, DSA, RSA Approach.
- Authentication System, Password Based Authentication, Dictionary Attacks, Challenge Response System, One Way Authentication, Mutual Authentication, Biometric System, Needham-Schroeder Scheme, Kerberos Protocol, Kerberos 5.
- Overview of Network Security, Digital Certificates, X.509 Certificates, Certificate Life Cycle Management.
- PKI Trust Models, PKIX, Email Security: PGP, SSL Protocol, TLS Protocol, IPSec Protocol, Firewalls, Types of Firewalls.
- Types of Malicious Logic: Virus, Worm, Trojan Horse, Zombies, Denial of Service Attacks, Intrusion, Intruders, Intrusion Detection System.
Students are required to develop programs in related topics using suitable programming languages such as Python or other similar languages.
- W. Stallings, Cryptography and Network Security: Principles and Practice.
- William Stallings, Network Security Essentials: Applications and Standards.
- Matt Bishop, Computer Security, Art and Science.
- Mark Stamp, Information Security: Principles and Practices.
- Bruce Schneier, Applied Cryptography.
- Douglas. R. Stinson, Cryptography: Theory and Practice.
- B. A. Forouzan, Cryptography & Network Security, Tata McGraw Hill.