Course Title: Introduction to Cryptography(Micro syllabus)

Course No. Csc313

Credit Hours: 3

Full Marks: 60+20+20

Pass Marks: 24+8+8

Nature of course: Theory(3 Hrs) + Lab(3 Hrs)

Goal: The course objective is to familiarize basic concepts of cryptography so as the students can use
their understanding for information security purpose.

Unit 1. Introduction

5hrs.

Encryption and Secrecy, The Objectives of Cryptography, Cryptanalysis, Attacks, Attack types(Active and
Passive), Cryptanalysis attacks(Cipher text only, Known-plaintext, Chosen-plaintext, Adaptively-chosenplaintext, chosen and adaptively-chosen-ciphertext), Bruit force attack
Viruses, Worms, Trojan Horses
Introduction and Terminology(Confidentiality, Authentication, Integrity)
Shannons Descriptions of a Conventional Cryptosystem
Classical Cryptosystems (Ceaser, Simple Substitution, Vigenere, Vernam, Simple XOR, Playfair, Hill
Transpositions), Rotor Machines, Hagelin, Enigma, Steganography

Unit 2. Basics of Modern Cryptography

Plaintext, Ciphertext, Keys, Simple Ciphers, Public Key Cryptography
One way Function(Trap Door Function), Symmetric and Asymmetric Cryptography(comparison), Digital
Signatures, Digital Signatures with Encryption

Unit 3. Conventional Encryption/ Secret Key Cryptography

10 Hrs.

Fiestel Cipher Structure, Encryption Algorithms, Block cipher and stream cipher, Data Encryption
Standard(DES), Multiple Encryption DES, International Data Encryption Algorithm(IDEA), Advanced
Encryption Standard(AES), Modes of Operation, Codebook Mode, Cipher Block Chaining(CBC) Mode

Unit 4. Public Key Cryptography

4 Hrs.

Basic Number theory

Modular Arithmetic(The Integers, The Integers Modulo n/ Residues), Primitive Roots and the Discrete
Logarithm, Groups, Rings, Fields, Ring of Polynomials, Residue Class Rings, Finite Fields, Quadratic
Residues, Modular Square Roots, Primes, Prime Factorization an Primality Tests(Introduction)

Downloaded from: http://CSITauthority.blogspot.com

The Concept of Public- Key Cryptography, Diffie-Hellman Key Exchange, RSA(Description, computational
aspect, security of RSA)

Unit 5. Digital Signatures

4 Hrs.

One-time signatures, digital signature standards(DSS), Digital Signature Algorithm

Unit 6. Hashing and Message Digests

6 Hrs

Hashes, Hash Functon vs MAC, Motivations and Applications, Collision free Hash Functions, The Birthday
Attack, Cryptographically Secure Hashing, Secure Hash Algorithm(SHA), Encryption with Message
Digest(MD), MD5

Unit 7. Authentication and Public Key Infrastructure(PKI)

5 Hrs.

Overview of Authentication Systems(Password, Address, Cryptographic), Security Handshake pitfalls,

authentication standards, Kerberos, PKI Trust Models

Unit 8. Network Security

5 Hrs.

IP Security, Web Security, Secure Socket Layer(SSL), Transport Layer Security(TLS), Secure Electronic
Transaction(SET), Different Versions of SNMPs ,PGP
Text/Reference books:
1. D.R. Stinson Cryptography, Theoruy and Practice, CRS Press
2. William Stallings, Network Security Essentials, Applications and Standards, Pearson
3. Charlie Kaufman, Radia Perlman, Mike Specinner, Network Security Private Communication in a
Public world, Second dition,2004, Pearson
4. Matt Bishop, Computer Security, Art and Science, Pearson
5. Bruce Schneier, Applied Cryptography, Pearson
LAB Works:
Subject teacher should assign lab works to the students related to course material covered in
the class successively. Lab works can be done by using any programming languages like c, C++,
JAVA, .Net or by using any Mathematical functions that are used to solve various algorithms
related to cryptography and its application.

Downloaded from: http://CSITauthority.blogspot.com