Course Lecture Plan

CP402
Date Lectures Topics Objectives

Thu
1/4

Introduction to
security attacks,
services and
mechanism,
introduction to
cryptography

Conventional

Encryption:
Conventional

encryption model,
classical

encryption
techniquessubstitution

After lecture student will be

Reading Practice Sheet
able

To define three security

goals
To define security attacks
that threaten security

goals
To define security
services and how they are
related to the three

security goals
To define security
mechanisms to provide
security services
To introduce two
techniques, cryptography
and steganography, to
implement security
mechanisms.

Will be able to distinguish

two security techniques
cryptography and
steganography
They will be able to explain
types of security attacks with
their implications and their
preventive mechanisms.
Stallings,
Will be able to understand Chapter 1
different security
Forouzan
mechanisms.
Chapter 1

To define Security
Models.

Explain Classical
Encryption Techniques
Introduce basic concepts

& terminology of
encryption

Able to define Security

Models.
Aware with different
Classical Encryption
Techniques
Aware with the basic
concepts & terminology of
encryption

Stallings,
Chapter 2
Forouzan
Chapter 3

Graded
Assignment
1.

1. Illustrate the basic approaches

to symmetric encryption and
the types of attacks.
2. Draw a simplified network security
model.
3. Write three security goals of security.
4. Differentiate cryptography and
steganography with suitable examples.

1. Write the two basic functions used

encryption algorithms.
2. Specify the difference between
diffusion and confusion.
3. List out the essential ingredients of a
symmetric cipher.
4. What is the difference between
differential and linear cryptanalysis

ciphers and
transposition

ciphers,
cryptanalysis,
stereography,
stream and block
ciphers.

Prepare us for studying

modern cryptography

Aware with the modern

cryptography terminologies

Various
Students will be able to write
algorithms and
their own simple algorithms
Examples
Substitution
Ciphers, Additive
Cipher, Shift
Cipher and Caesar
Cipher,
To know various substitution
Multiplicative
cipher and transposition cipher
Ciphers ,
algorithms
Monoalphabetic
Substitution
Cipher, Playfair
Cipher,
Hill Cipher,
transposition
cipher Algorithms

block cipher
modes of
operations
Tue
1/9

Students will be able to know

To know various mode of
how to perform various
operations for both block and operations of block and stream
stream cipher algorithms
cipher operations

5. Illustrate with examples the various

classical encryption techniques.

Take plain text and convert to cipher text

using following algorithms
Stallings, Additive Cipher, Shift Cipher and Caesar
Chapter 2 Cipher, Multiplicative Ciphers ,
Monoalphabetic Substitution Cipher,
Playfair Cipher,
Hill Cipher, transposition cipher Algorithms

Stallings,
Chapter 2

Festal structure, DES having the following Students will able to run DES Stallings,
using their own plain text
Chapter 3
data encryption objectives
They
can
differentiate
the
use
of
standard(DES), 1. High level of security.
strength of DES, 2. Completely specified and private key and public key
process
differential and
easy to understand
linear crypt
3. Cryptographic security

analysis of DES,
block cipher
modes of
4.
operations, triple
DES,
5.

do not depend on
algorithm secrecy
Adaptable to diverse
applications
Efficient

Encryption
Example of DES
Students can encrypt own text
The block cipher IDEA
using IDEA algorithm
operates with 64-bit
IDEA encryption plaintext and cipher text
and decryption, blocks and is controlled by
a 128-bit key.
strength of
To know the structure of the
IDEA
algorithm (different key subblocks are used)

Stallings,
Chapter 4

confidentiality
using
conventional
encryption,
traffic
confidentiality,
key distribution,
random number
generation

Students will be able to explain

different objectives of
cryptography and key
How secure the conventional management

encryption methods are.

How to distributed private
key

Stallings,
Chapter 4

Introduction to
graph, ring and
field

Need to perform various

algorithmic operations

Stallings,
Chapter 4

prime and relative Some mathematical

prime numbers, operations which are to be
modular
performed in various
arithmetic
algorithms
Fermats and

Stallings,
Chapter 8

Eulers theorem,
primality testing,

theorem,
primality testing,
Euclids
Algorithm,
Chinese
Remainder
theorem, discrete
logarithms.
Principals of
public key
crypto systems,
RSA algorithm,

Thu
security of RSA,
1/11

key management

Stallings,
Chapter 8

Stallings,
Homework 1 out.
Chapter 9

Diffle-Hellman
key exchange
algorithm,

Stallings,
Chapter 10

Introductory
idea of Elliptic
curve
cryptography,
Elganel
encryption.

Stallings,
Chapter 10