COMSATS University Islamabad

Department of Computer Science

Course Description Form (CDF)

Course Information
Course Code: CSC232 Course Title: Information Security
Credit Hours: 3(2,1) Lecture Hours/Week: 3
Lab Hours/Week: 0 Pre-Requisites: None
Catalogue Description:
This course introduces the concepts of cryptography along with encryption standards and algorithms. Topics
include: Overview of Cryptography and Cryptanalysis, aspects of security, classical encryption techniques, and
substitution and transposition ciphers. Block cipher and data encryption standard. Basic Concepts in Number
Theory and Finite Fields. Public-Key Cryptography and RSA. Hash function and Digital Signature.
Unit wise Major Topics:
No. of teaching
Unit Topic hours
Cryptography. Overview, private vs. public-key ciphers, MACs vs. signatures,
1. certificates, capabilities of adversary, Kerckhoffs’ principle. 3
Classic ciphers. Attacks on substitution and transposition ciphers, Vigenére.
Perfect secrecy: one-time pads.
Private-key encryption. Stream ciphers, pseudo-random generators, attacking
linear-congruential RNGs and LFSRs. Semantic security definitions, oracle
queries, advantage, computational security. (Tools: CrypTool, OpenStego)
Block ciphers. Pseudo-random functions and permutations: Birthday
2. 6
problem, random mappings. Feistel/Luby-Rackoff structure, DES, TDES, AES.
(Tool: twofish, AES Crypt, Python codes)
Chosen-plaintext attack security: Security with multiple encryptions,
randomized encryption. Modes of operation: ECB, CBC, OFB, CNT.
Message authenticity: Malleability, MACs, existential unforgeability, CBC-
3. MAC, ECBC-MAC, CMAC, birthday attacks, Carter-Wegman one-time MAC. 6
Authenticated encryption: Chosen-ciphertext attack security, ciphertext
integrity, encrypt-and-authenticate, authenticate-then-encrypt, encrypt-then-
authenticate, padding oracle example, GCM. (Tool: Visual Cryptography Toolkit)
Secure hash functions: One-way functions, collision resistance, padding,
4. Merkle-Damgård construction, sponge function, duplex construct, entropy pool, 6
SHA standards.
Applications of secure hash functions: HMAC, stream authentication, Merkle
tree, commitment protocols, Block chain technology.
Key distribution problem: Needham-Schroeder protocol, Kerberos, hardware-
5. 6
security modules, public-key encryption schemes. (Tool: CryptoSys API,
cryptophane,).
Number theory, finite groups and fields: Modular arithmetic, Euclid’s
algorithm, inversion, groups, rings, fields, GF(2n), subgroup order, cyclic groups,
Euler’s theorem, Chinese remainder theorem, modular roots, quadratic residues,
modular exponentiation, easy and difficult problems.
Discrete logarithm problem: Baby-step-giant-step algorithm, computational and
decision Diffie-Hellman problem, DH key exchange, ElGamal encryption, hybrid
cryptography, Schnorr groups, elliptic-curve systems, key sizes.

1
 Trapdoor permutations: Security definition, turning one into a public-key
encryption scheme, RSA, attacks on “textbook” RSA, RSA as a trapdoor
permutation, optimal asymmetric encryption padding, common factor attacks.
Digital signatures: One-time signatures, RSA signatures, Schnorr identification
6. scheme, ElGamal signatures, DSA, PS3 hack, certificates, PKI. 3

Total Contact Hours 30

Mapping of CLOs and GAs
Blooms
Sr.# Unit # Course Learning Outcomes Taxonomy GA
Learning Level
CLOs for Theory

CLO-1 1-2 Describe the data security algorithms and techniques. Understanding 2
Analyze the mathematical techniques that are applied in
CLO-2 2-6 modern cryptographic algorithms. Analyze 2,3
Apply the appropriate cryptographic algorithm considering the
CLO-3 2-6 network application scenario. Applying 2,3
CLOs for Lab

Apply the knowledge appropriate to the discipline particularly

CLO-4 2-6 in the field of data security. Applying 2,5
Develop a project for a real-world problem in a team
CLO-5 2-6 environment. Creating 4-6

CLO Assessment Mechanism

Assessment
CLO-1 CLO-2 CLO-3 CLO-4 CLO-5
Tools

Quizzes Quiz 1 Quiz 2&3 Quiz 4 - -

Assignment Lab
Assignments Assignment 1 Assignment 2 -
3&4 Assignments
Mid Term Mid Term Mid Term
- - -
Exam Exam Exam
Final Term Lab Terminal/Lab
Final Term Exam -
Exam Project
Text and Reference Books
Textbooks:
1. A Graduate Course in Applied Cryptography, Dan Boneh and Victor Shoup, 2023.
2. Cryptography and Network Security: Principles and Practice, William Stallings, Pearson, Prentice Hall, 2020.
3. Katz, J., Lindell, Y., Introduction to modern cryptography. Chapman and Hall/CRC, 2015.
Reference Books:
1. Cryptography - Theory and Practice, 4. edition, Stinson D., Paterson M., CRC Press, 2018.
2. Serious Cryptography, Aumasson, J-P, No Starch Press, 2018.