You are on page 1of 18

K L Deemed to be University

Department of Computer Science & Engineering


Course Handout Y17Admitted Batch
A.Y.2018-19, Odd Semester

Course Title : CRYPT ANALYSIS AND CYBER DEFENCE


Course Code : 17 CS 3175
L-T-P-S Structure : 2-0-2-2
Credits : 3.5
Pre-requisite : COMPUTER NETWORKS (17 CS 2209R & 17 CS 2209A)
Course Coordinator : Mrs. V. DIVYA
:Dr. G. Swain, Mr. A.V. Praveen Krishna, Dr. S.
Team of Instructors
Ananthakumaran
Teaching : Mr. K V Raju, Dr. T. Pavan Kumar, Dr. B. Tirupathi Reddy,
Associates(Skilling) Mr. K. David Raju

Course Objective
The main objective of this course is to make the students understand basic concepts in
cryptography & network security and their mathematical models. They have to acquire
knowledge on security issues, goals, mechanisms. Encryption & Decryption using block and
stream ciphers. A detailed study on hash and MAC algorithms is to be conducted. A clear
insight on digital signature algorithms is to be analysed, so that students will be able to know
how to sign and verify messages. Possible Crypt Analytic attacks in each algorithm is to be
analyzed.

Course Rationale
This course introduces the fundamental principles of cryptography and its applications on the
network security domain. Students will become familiar with cryptographic techniques for
secured communication over an unsecured channel; verification of the authenticity of the
source of a message; verification of the integrity of the messages transmitted via an
unsecured channel and unique identification of the originator of any message. Cryptanalysis
attacks against the cryptographic techniques, and attack models will be presented.
Furthermore, it will be illustrated on how network security and management mechanisms
employ cryptography to prevent, detect, and mitigate security threats against the network.

COURSE OUTCOMES (COs):


Blooms
Course Outcome Taxonomy
CO No PO/PSO
(CO) Level
(BTL)
Understand the principles of cryptography by ½ 3
CO1 analyzing various attacks and apply different
classic encryption techniques.
Understand the principles of block cipher 5/2 3
CO2
and analyze algorithms like DES, AES.
Understand and apply different algorithms of 5/2 3
CO3 public key crypto system for ensuring
secured communication.

1
Apply Security engineering principles and 5/2 3
respective algorithms to achieve
CO4
authentication, integrity and digital
certification.
Implement various cryptographic algorithms 5/2 4
so as to analyze the achievability of security
CO5 (Only for lab
components)
goals like Confidentiality, integrity,
authentication and also Justify the possibility
of cryptanalysis attack with each algorithm.

COURSE OUTCOME INDICATORS (COIs):

CO COI
Course
Highest COI-1 COI-2 COI-3 COI-4 I-5 -6
Outcome
BTL (BTL1) (BTL2) (BTL3) (BTL4) (BT (BT
No.
L5) L6)
Apply various
Compare and Classic encryption
Understand the
Contrast all techniques and
basic Security
CO 1 3 possible passive identify the
goals and
and active possibility of
mechanisms
attacks. attack for each
mechanism.
Understand the Identify the
basic algorithms to
principles of apply Principles
Demonstrate the
block cipher of Pseudorandom
functionality of
techniques and Number
CO 2 3 AES, compare
analyze the Generation.
and contrast
functionality
AES with DES
of DES and
AES
algorithms.
Illustrate Apply and
various public Analyse elliptic
Understand the
key crypto curve crypto
principle
algorithms like system
architecture of
Diffie hellman
CO 3 3 Public key
Key exchange
cryptosystem
and possible
and RSA
crypt analytic
algorithm.
attack on each
of them
Apply and
Analyse various
Understand the Demonstrate the algorithms and
principle principle mechanisms to
CO 4 3
architecture of architecture of achieve
authentication SHA. authentication and
digital
certification.
Implement and Implement and Implement and Implement
analyze analyze various analyze and analyze
various Classic Public key algorithms to algorithms
CO5 4 achieve to achieve
encryption encryption
techniques Algorithms authentication and digital
using using digital certification

2
C/python. C/python/Crypt certification using using
tool. C/python/Crypt C/python/Cr
tool. ypt tool.

PROGRAM OUTCOMES & PROGRAM SPECIFIC OUTCOMES (POs/PSOs):


PO1(Engineering Knowledge):An ability to apply knowledge of mathematics, science,
engineering fundamentals and an engineering specialization for the solution of complex
engineering problems in engineering.

PO5(Modern Tool Usage): Ability to create, select and apply appropriate techniques,
resources and modern engineering activities, with an understanding of the limitation.

PSO2: Ability to gain working Knowledge on emerging software tools and technologies.

SYLLABUS:
Introduction to Security: Security Concepts, Security Attacks, Security Services and
Mechanisms, A Security Model, Classical Encryption Techniques: Symmetric Cipher Model,
Substitution Techniques, Transposition Techniques.
Block Ciphers and DES: Traditional Block Cipher Structure, DES, DES Example, Strength
of DES, Differential and Linear Cryptanalysis, Block Cipher Design Principles. AES: Finite
Field Arithmetic, AES Structure, AES Transformation Functions, AES Example, AES
Implementation. Block Cipher Operation: Multiple Encryption and Triple DES, Modes of
Operation, Pseudorandom Number Generation and Stream Ciphers: Principles and
Pseudorandom Number Generation, Pseudorandom Number, Generators, Pseudorandom
Number Generation using a Block Cipher, Stream, Ciphers, RC4.
Public-key Cryptography and RSA: Principles of Public-Key Cryptosystems, the RSA
algorithm. Other Public-key Cryptosystems: Diffie-Hellman Key Exchange, ElGamal
Cryptosystem, Elliptic Curve Arithmetic Elliptic Curve Cryptography.
Cryptographic Hash Functions: Applications of Cryptographic Hash functions, Two Simple
Hash Functions, Requirements and Security, Hash Functions based on Cipher Block
Chaining, SHA. Message Authentication, Digital Signatures: Digital Signatures, ElGamal
Digital Signature Scheme

Text books:
1. Cryptography and Network Security Principles and Practice, by William stallings,
Pearson, 5th edition.
2. Applied Cryptography: Protocols, Algorthms, and Source Code in C , by Bruce Schneier,
Second Edition , John Wiley & Sons, Inc., 2015
Reference Books:
1. Applied Cryptography for Cyber Security and Defense: Information Encryption and
Cyphering, by Hamid R. Nemati and Li Yang, IGI Global, 2011
2. Forouzon B, “Cryptography and Network Security,” Indian Edition, TMH (2010).

WEB REFERNCES/MOOCS:
Coursera:
1. https://www.coursera.org/learn/crypto
2. https://www.coursera.org/learn/information-security-data

3
3. https://www.coursera.org/learn/crypto?action=enroll&authMode=signup
Udemy
4. https://www.udemy.com/introduction-to-cryptography-online-course-rahsoft-
crypto-certificate/
5. https://www.udemy.com/introduction-to-cryptography-online-course-rahsoft-crypto-certificate/
6. https://www.udemy.com/iso-27001-cybersecurity-manager-guidelines/
Udacity: 7. https://in.udacity.com/course/applied-cryptography--cs387
EdX: 8. https://www.edx.org/course/cybersecurity-fundamentals-2

COURSE DELIVERY PLAN:


Teac
Sessi hing- Evaluati
Soft Copy
CO COI Interactive Lear on
on Topic(s) Book No[CH
Video ning Compon
NO. NO. No][Page No]
NO. Meth ents
ods
PPT/
Test-1
boar
Course Handout, and
TB-1 Chapter d
1 CO 1 COI 1 Introduction to Security: SEM
1.1,pageno.9 and
Security Concepts END
Mar
exam
ker
https://moo
Test-1
dle.kluniver
Security Services and TB-1 Chapter and
sity.in/mod/
2 CO 1 COI 1 Mechanisms, Security 1.3,pageno.1 PPT SEM
hvp/view.ph
Model 5 END
p?id=26285
exam
2
https://moo
dle.kluniver Test-1
TB-1 Chapter sity.in/mod/ and
3 CO 1 COI 2 Security Attacks 1.4,1.5,pagen hvp/view.ph PPT SEM
o.19 to 25 p?id=26285 END
2 exam

https://moo PPT/
Test-1
dle.kluniver Boar
Introduction to Classical TB-1 Chapter and
sity.in/mod/ d
4 CO 1 COI 2 Encryption Techniques, 2.1,pageno.3 SEM
hvp/view.ph and
Symmetric Cipher Model 3 to 38 END
p?id=26285 Mar
exam
3 ker
https://moo PPT/
Test-1
dle.kluniver Boar
TB-1 Chapter and
sity.in/mod/ d
5 CO 1 COI 3 Substitution Techniques 2.1,pageno.3 SEM
hvp/view.ph and
3 to 38 END
p?id=26285 Mar
exam
4 ker
TB-1 Chapter https://moo PPT/ Test-1
Substitution Techniques and
6 CO 1 COI 3 2.3,pageno. dle.kluniver Boar and
Transposition Techniques.
53 sity.in/mod/ d SEM

4
hvp/view.ph and END
p?id=26285 Mar exam
4 ker
https://moo PPT/
Test-1
dle.kluniver Boar
TB-1 Chapter and
sity.in/mod/ d
7 CO 1 COI 3 Transposition Techniques 2.3,pageno. SEM
hvp/view.ph and
53 END
p?id=26285 Mar
exam
7 ker
https://moo PPT/
Test-1
dle.kluniver Boar
Traditional Block Cipher TB-1 Chapter and
sity.in/mod/ d
8 CO 2 COI 1 Structure, DES, DES 3.1,pageno. SEM
hvp/view.ph and
Example 68 END
p?id=26544 Mar
exam
3 ker
https://moo
Test-1
Strength of DES, dle.kluniver
TB-1 Chapter and
Differential and Linear sity.in/mod/
9 CO 2 COI 1 3.8,pageno. PPT SEM
Cryptanalysis, Block Cipher hvp/view.ph
88 END
Design Principles. p?id=26544
exam
3
https://moo
Test-1
dle.kluniver
TB-1 Chapter and
AES Structure, AES sity.in/mod/
10 CO 2 COI 2 5.1,pageno. PPT SEM
Transformation Functions hvp/view.ph
148 END
p?id=26544
exam
6
https://moo PPT/
Test-1
dle.kluniver Boar
TB-1 Chapter and
sity.in/mod/ d
11 CO 2 COI 2 AES Example 5.1,pageno. SEM
hvp/view.ph and
148 END
p?id=26544 Mar
exam
6 ker
https://moo
Test-1
dle.kluniver
Multiple Encryption and TB-1 Chapter and
sity.in/mod/
12 CO 2 COI 3 Triple DES, Modes of 6.1, pageno. PPT SEM
hvp/view.ph
Operation. 193 END
p?id=26545
exam
4
https://moo PPT/
Test-1
Principles and dle.kluniver Boar
TB-1 Chapter and
Pseudorandom Number sity.in/mod/ d
13 CO 2 COI 3 7.1,pageno. SEM
Generation, Pseudorandom hvp/view.ph and
219 END
Number, Generators p?id=26563 Mar
exam
4 ker
https://moo PPT/ Test-1
TB-1 Chapter dle.kluniver Boar and
14 CO 2 COI 3 Stream Ciphers, RC4 7.5,pageno. sity.in/mod/ d SEM
234 hvp/view.ph and END
p?id=26563 Mar exam

5
4 ker
https://moo
Test-2
dle.kluniver
TB-1 Chapter and
Principles of Public-Key sity.in/mod/
15 CO 3 COI-1 9.1,pageno. PPT SEM
Cryptosystems hvp/view.ph
269 END
p?id=26682
exam
3
https://moo PPT/
Test-2
dle.kluniverBoar
TB-1 Chapter and
sity.in/mod/ d
16 CO 3 COI-1 RSA algorithm 9.2,pageno. SEM
hvp/view.ph and
277 END
p?id=26682 Mar
exam
5 ker
https://moo PPT/
Test-2
dle.kluniverBoar
Other Public-key TB-1 Chapter and
sity.in/mod/ d
17 CO 3 COI-2 Cryptosystems: Diffie- 10.1,pageno. SEM
hvp/view.ph and
Hellman Key Exchange 301 END
p?id=26682 Mar
exam
7 ker
PPT/
Test-2
Boar
TB-1 Chapter and
d
18 CO 3 COI-2 ElGamal Cryptosystem 10.2,pageno. SEM
and
305 END
Mar
exam
ker
https://moo PPT/
Test-2
dle.kluniver Boar
TB-1 Chapter and
Elliptic Curve Arithmetic sity.in/mod/ d
19 CO 3 COI-3 10.4,pageno. SEM
Elliptic Curve Cryptography hvp/view.ph and
317 END
p?id=26682 Mar
exam
8 ker
https://moo PPT/
Test-2
dle.kluniversi Boar
TB-1 Chapter ty.in/mod/hv and
Elliptic Curve Arithmetic d
20 CO 3 COI-3 10.4,pageno. p/view.php?i SEM
Elliptic Curve Cryptography and
317 d=266828 END
Mar
exam
ker
Test-2
Cryptographic Hash
TB-1 Chapter and
Functions: Applications of
21 CO 4 COI-1 11.1,pageno. PPT SEM
Cryptographic Hash
329 END
functions
exam
Test-2
TB-1 Chapter and
22 CO 4 COI-1 Two Simple Hash Functions 11.2,pageno. PPT SEM
333 END
exam
TB-1 Chapter https://moo Test-2
Requirements and Security
23 CO 4 COI-1 11.3,pageno. dle.kluniver PPT and
of Hash
335 sity.in/mod/ SEM

6
hvp/view.ph END
p?id=26683 exam
0
https://moo
Test-2
dle.kluniver
TB-1 Chapter and
sity.in/mod/
24 CO 4 COI-2 Secure Hash Algorithm 11.4,pageno. PPT SEM
hvp/view.ph
342 END
p?id=26683
exam
0
https://moo
Test-2
dle.kluniver
TB-1 Chapter and
sity.in/mod/
25 CO 4 COI-2 Secure Hash Algorithm 11.4,pageno. PPT SEM
hvp/view.ph
342 END
p?id=26683
exam
0
Test-2
TB-1 Chapter and
26 CO 4 COI-3 Message Authentication 12.1,pageno. PPT SEM
364 to 374 END
exam
https://moo
Test-2
dle.kluniver
TB-1 Chapter and
Digital Signatures sity.in/mod/
27 CO 4 COI-3 13.1 ,pageno. PPT SEM
Introduction hvp/view.ph
395 END
p?id=26683
exam
2
https://moo PPT/
Test-2
dle.kluniver Boar
TB-1 Chapter and
ElGamal Digital Signature sity.in/mod/ d
28 CO 4 COI-3 13.2,pageno. SEM
Scheme hvp/view.ph and
400 END
p?id=26683 Mar
exam
2 ker

SESSION WISE TEACHING – LEARNING PLAN

SESSION NUMBER: 01
Session Outcome: 1.Understand the Course Handout and Evaluation Pattern
2.To Demonstrate Security Concepts

Time Teaching - Active


Topic BTL
(min) Learning Methods LearningMethods
PPT/ board and
10 Course Handout 2
Marker
PPT/ board and
10 Course Handout 2
Marker
PPT/ board and
10 Introduction to Security: Security Concepts 1
Marker
PPT/ board and
10 List the applications of security 3
Marker
PPT/ board and
5 Overview 2
Marker
45 minutes Total Contact Session + 5 minutes for Attendance and Transition activities = 50 Minutes

7
SESSION NUMBER: 02
Session Outcome: 1. Classify Security Services and Security Mechanisms.
2. Illustrate Security Model.

Time Teaching - Active


Topic BTL
(min) Learning Methods LearningMethods
PPT/ board and
5 Recapitulate 2
Marker
PPT/ board and
15 Security Services 2
Marker
PPT/ board and
10 Security Model 2
Marker
PPT/ board and
10 List and explain various Security Mechanisms 3
Marker
PPT/ board and
5 Overview 2
Marker
45 minutes Total Contact Session + 5 minutes for Attendance and Transition activities = 50 Minutes

SESSION NUMBER: 03
Session Outcome: 1. Classify various Security Attacks

Time Teaching - Active


Topic BTL
(min) Learning Methods LearningMethods
5 Recapitulate 2 PPT
PPT
15 Passive Attacks 2
PPT
10 Active Attacks 2
PPT Quick write-1
10 Compare and contrast active and passive attacks 3
PPT
5 Overview 2

45 minutes Total Contact Session + 5 minutes for Attendance and Transition activities = 50 Minutes

SESSION NUMBER: 04
Session Outcome: 1. Illustrate the Model of symmetric encryption.
2.List and explain various crypt analysis attacks.

Time Teaching - Active


Topic BTL
(min) Learning Methods LearningMethods
Recapitulate and Overview on Classic Encryption
15 2 PPT
techniques.
PPT
15 Symmetric Cipher Model 2
PPT
10 Crypt Analysis Attacks 3
PPT
5 Overview 2

45 minutes Total Contact Session + 5 minutes for Attendance and Transition activities = 50 Minutes

SESSION NUMBER: 05
Session Outcome: 1. Able to Understand and apply various Classic encryption techniques (Substitution
Techniques)

Time Teaching - Active


Topic BTL
(min) Learning Methods LearningMethods
PPT/ board and
5 Recapitulate 2
Marker

8
PPT/ board and
15 Ceaser Cipher, Vigenere 2
Marker
PPT/ board and
10 Play fair, Mono alphabetic 2
Marker
PPT/ board and
10 Problem solving 3
Marker
PPT/ board and
5 Overview 2
Marker
45 minutes Total Contact Session + 5 minutes for Attendance and Transition activities = 50 Minutes

SESSION NUMBER: 06
Session Outcome: Able to Understand and apply various Classic encryption techniques (Substitution and
Transposition Techniques)

Time Teaching - Active


Topic BTL
(min) Learning Methods LearningMethods
PPT/ board and
5 Recapitulate 2
Marker
PPT/ board and
15 Hill Cipher 2
Marker
PPT/ board and Problem Solving-1
10 Rail Fence Encryption and Decryption mechanism 2
Marker
PPT/ board and
10 Problem Solving 3
Marker
PPT/ board and
5 Overview 2
Marker
45 minutes Total Contact Session + 5 minutes for Attendance and Transition activities = 50 Minutes

SESSION NUMBER: 07
Session Outcome: 1. Able to Understand and apply various Classic encryption techniques(Transposition
techniques)
Time Teaching - Active
Topic BTL
(min) Learning Methods LearningMethods
PPT/ board and
5 Recapitulate 2
Marker
PPT/ board and
15 Columnar Cipher 2
Marker
PPT/ board and
10 Other Classic Encryption Techniques 2
Marker
PPT/ board and Quiz-1
10 Problem Solving 3
Marker
PPT/ board and
5 Overview 2
Marker
45 minutes Total Contact Session + 5 minutes for Attendance and Transition activities = 50 Minutes

SESSION NUMBER: 08
Session Outcome: 1. Outline Traditional Block Cipher Structure
2.Illustrate DES with an Example.
Time Teaching - Active
Topic BTL
(min) Learning Methods LearningMethods
PPT/ board and
5 Recapitulate 2
Marker
PPT/ board and
15 Fiestal Structure 2
Marker
PPT/ board and
10 DES Functionality 2
Marker
PPT/ board and
10 DES example 3
Marker

9
PPT/ board and
5 Overview 2
Marker
45 minutes Total Contact Session + 5 minutes for Attendance and Transition activities = 50 Minutes

SESSION NUMBER: 09
Session Outcome: 1. Outline Differential and Linear Cryptanalysis, Block Cipher Design
Principles.
Time Teaching - Active
Topic BTL
(min) Learning Methods LearningMethods
PPT/ board and
5 Recapitulate 2
Marker
PPT/ board and
15 DES Strengths 2
Marker
PPT/ board and
10 Linear and Differential Crypt analysis Attacks 3
Marker
PPT/ board and
10 Block Cipher design principles 2
Marker
PPT/ board and
5 Overview 2
Marker
45 minutes Total Contact Session + 5 minutes for Attendance and Transition activities = 50 Minutes

SESSION NUMBER: 10
Session Outcome: 1.Illustrate AES architecture with a simple example.
Time Teaching - Active
Topic BTL
(min) Learning Methods LearningMethods
PPT/ board and
5 Recapitulate 2
Marker
PPT/ board and
15 AES Architecture 2
Marker
PPT/ board and
10 AES Operations and Key expansion 2
Marker
PPT/ board and
10 AES example 3
Marker
PPT/ board and
5 Overview 2
Marker
45 minutes Total Contact Session + 5 minutes for Attendance and Transition activities = 50 Minutes

SESSION NUMBER: 11
Session Outcome: 1. AES example.
Time Teaching - Active
Topic BTL
(min) Learning Methods LearningMethods
PPT/ board and
5 Recapitulate 2
Marker
PPT/ board and
15 AES Example 2
Marker
PPT/ board and
10 AES Key Generation example 3
Marker
PPT/ board and Problem Solving-2
10 AES Operations example 2
Marker
PPT/ board and
5 Overview 2
Marker
45 minutes Total Contact Session + 5 minutes for Attendance and Transition activities = 50 Minutes

SESSION NUMBER: 12
Session Outcome: 1. Multiple Encryption and Triple DES, Modes of Operation.
Time Teaching - Active
Topic BTL
(min) Learning Methods LearningMethods
5 Recapitulate 2 PPT/ board and

10
Marker
PPT/ board and
15 Triple DES 2
Marker
PPT/ board and
10 Modes of Operation 3
Marker
PPT/ board and
10 Modes of Operation 3
Marker
PPT/ board and
5 Overview 2
Marker
45 minutes Total Contact Session + 5 minutes for Attendance and Transition activities = 50 Minutes

SESSION NUMBER: 13
Session Outcome: 1. Understand the Principles and Pseudorandom Number Generation,
2. Apply variousPseudorandom Number Generator Algorithms.
Time Teaching - Active
Topic BTL
(min) Learning Methods LearningMethods
PPT/ board and
5 Recapitulate 2
Marker
PPT/ board and
15 Principles of Pseudo random Number generator 2
Marker
PPT/ board and
10 Linear Congruential PRNG 3
Marker
PPT/ board and Quiz-2
10 Blum Blum Shub PRNG 3
Marker
PPT/ board and
5 Overview 2
Marker
45 minutes Total Contact Session + 5 minutes for Attendance and Transition activities = 50 Minutes

SESSION NUMBER: 14
Session Outcome: 1. Understand the principle architecture of Stream Ciphers, RC4
Time Teaching - Active
Topic BTL
(min) Learning Methods LearningMethods
PPT/ board and
5 Recapitulate 2
Marker
PPT/ board and
15 Understanding the basic structure of stream cipher RC4 2
Marker
PPT/ board and
10 Example on RC4 3
Marker
PPT/ board and Problem Solving-3
10 Example on RC4 3
Marker
PPT/ board and
5 Overview 2
Marker
45 minutes Total Contact Session + 5 minutes for Attendance and Transition activities = 50 Minutes

SESSION NUMBER: 15
Session Outcome: 1. Principles of Public-Key Cryptosystems
Time Teaching - Active
Topic BTL
(min) Learning Methods LearningMethods
PPT/ board and
5 Recapitulate 2
Marker
PPT/ board and
15 Model of Public key Cryptosystem 2
Marker
Understand the basic definitions of Public key crypto PPT/ board and
10 2
system Marker
Comparison between Conventional and Publickey PPT/ board and
10 3
encryption Marker
PPT/ board and
5 Overview 2
Marker

11
45 minutes Total Contact Session + 5 minutes for Attendance and Transition activities = 50 Minutes

SESSION NUMBER: 16
Session Outcome:Understand RSA algorithm with a simple example
Time Teaching - Active
Topic BTL
(min) Learning Methods LearningMethods
PPT/ board and
5 Recapitulate 2
Marker
PPT/ board and
15 Euler’s Totient function 2
Marker
PPT/ board and Problem Solving-4
10 RSA algorithm 2
Marker
PPT/ board and
10 Example 3
Marker
PPT/ board and
5 Overview 2
Marker
45 minutes Total Contact Session + 5 minutes for Attendance and Transition activities = 50 Minutes

SESSION NUMBER: 17
Session Outcome:Outline the attacks on Diffie-Hellman Key Exchange
Time Teaching - Active
Topic BTL
(min) Learning Methods LearningMethods
PPT/ board and
5 Recapitulate 2
Marker
PPT/ board and
15 Diffie Hellman key exchange algorithm 2
Marker
PPT/ board and
10 Attacks on Diffie Hellman key exchange 2
Marker
PPT/ board and Problem Solving-5
10 Example 3
Marker
PPT/ board and
5 Overview 2
Marker
45 minutes Total Contact Session + 5 minutes for Attendance and Transition activities = 50 Minutes

SESSION NUMBER: 18
Session Outcome:Understand ElGamal Cryptosystem.
Time Teaching - Active
Topic BTL
(min) Learning Methods LearningMethods
PPT/ board and
5 Recapitulate 2
Marker
PPT/ board and
15 Elgamal Crypto System 2
Marker
PPT/ board and
10 Elgamal Crypto System 2
Marker
PPT/ board and
10 Example 3
Marker
PPT/ board and
5 Overview 2
Marker
45 minutes Total Contact Session + 5 minutes for Attendance and Transition activities = 50 Minutes

SESSION NUMBER: 19
Session Outcome:Outline theElliptic Curve Arithmetic Elliptic Curve Cryptography
Time Teaching - Active
Topic BTL
(min) Learning Methods LearningMethods
PPT/ board and
5 Recapitulate 2
Marker
PPT/ board and
15 Types of Elliptic curves 2
Marker

12
PPT/ board and
10 Finding Slope of a point, overview on Point of Infinity 2
Marker
PPT/ board and
10 Example 3
Marker
PPT/ board and
5 Overview 2
Marker
45 minutes Total Contact Session + 5 minutes for Attendance and Transition activities = 50 Minutes

SESSION NUMBER: 20
Session Outcome:Outline the Elliptic Curve Arithmetic Elliptic Curve Cryptography
Time Teaching - Active
Topic BTL
(min) Learning Methods LearningMethods
PPT/ board and
5 Recapitulate 2
Marker
Process to verify whether the point lies on Elliptic PPT/ board and
15 2
curve or not Marker
PPT/ board and
10 Elliptic curve encryption and decryption Algorithm 2
Marker
PPT/ board and Quiz-3
10 Example 3
Marker
PPT/ board and
5 Overview 2
Marker
45 minutes Total Contact Session + 5 minutes for Attendance and Transition activities = 50 Minutes
SESSION NUMBER: 21
Session Outcome:Outline various Applications of Cryptographic Hash functions
Time Teaching - Active
Topic BTL
(min) Learning Methods LearningMethods
PPT/ board and
5 Recapitulate 2
Marker
Simple example of Cryptographic hash function for PPT/ board and
15 3
message authentication and digital signature. Marker
Simple example of Cryptographic hash function for PPT/ board and
10 3
digital signature. Marker
Simple example of Cryptographic hash function for PPT/ board and
10 3
digital signature. Marker
PPT/ board and
5 Overview 2
Marker
45 minutes Total Contact Session + 5 minutes for Attendance and Transition activities = 50 Minutes
SESSION NUMBER: 22
Session Outcome:Understand Simple Hash Functions
Time Teaching - Active
Topic BTL
(min) Learning Methods LearningMethods
PPT/ board and
5 Recapitulate 2
Marker
PPT/ board and
15 Simple Hash function 2
Marker
PPT/ board and
10 Flaws in the basic Hash functions 2
Marker
PPT/ board and
10 Example 3
Marker
PPT/ board and
5 Overview 2
Marker
45 minutes Total Contact Session + 5 minutes for Attendance and Transition activities = 50 Minutes
SESSION NUMBER: 23
Session Outcome:Outline the Requirements and Security of Hash
Time Teaching - Active
Topic BTL
(min) Learning Methods LearningMethods
5 Recapitulate 2 PPT/ board and

13
Marker
PPT/ board and
15 Pre image resistance and Second pre image resistance 2
Marker
PPT/ board and
10 Other Requirements 2
Marker
PPT/ board and
10 Properties of secure Hash 3
Marker
PPT/ board and
5 Overview 2
Marker
45 minutes Total Contact Session + 5 minutes for Attendance and Transition activities = 50 Minutes
SESSION NUMBER: 24
Session Outcome: Illustrate Secure Hash Algorithm
Time Teaching - Active
Topic BTL
(min) Learning Methods LearningMethods
PPT/ board and
10 Recapitulate 2
Marker
PPT/ board and Quiz-4
15 Overall Architecture of Hash 3
Marker
PPT/ board and
15 SHA processing of single 1024-bit data 3
Marker
PPT/ board and
5 Overview 2
Marker
45 minutes Total Contact Session + 5 minutes for Attendance and Transition activities = 50 Minutes
SESSION NUMBER: 25
Session Outcome: Illustrate Secure Hash Algorithm Round Operation
Time Teaching - Active
Topic BTL
(min) Learning Methods LearningMethods
PPT/ board and
10 Recapitulate 2
Marker
PPT/ board and
15 Round Operation 3
Marker
Detailed Understanding of each function in round PPT/ board and
15 3
operation Marker
PPT/ board and
5 Overview 2
Marker
45 minutes Total Contact Session + 5 minutes for Attendance and Transition activities = 50 Minutes

SESSION NUMBER: 26
Session Outcome:Outline the requirements of Message Authentication
Time Teaching - Active
Topic BTL
(min) Learning Methods LearningMethods
PPT/ board and
5 Recapitulate 2
Marker
PPT/ board and Quiz-5
15 Requirements of Message authetication 2
Marker
PPT/ board and
10 Message authentication functions 2
Marker
PPT/ board and
10 Message authentication Code 3
Marker
PPT/ board and
5 Overview 2
Marker
45 minutes Total Contact Session + 5 minutes for Attendance and Transition activities = 50 Minutes

SESSION NUMBER: 27
Session Outcome:Outline the importance of Digital Signatures
Time Teaching - Active
Topic BTL
(min) Learning Methods LearningMethods

14
PPT/ board and
5 Recapitulate 2
Marker
PPT/ board and
15 Generic Model of Digital signature 2
Marker
PPT/ board and
10 Attacks and forgeries Possible 3
Marker
PPT/ board and
10 Requirements of Digital signature 2
Marker
PPT/ board and
5 Overview 2
Marker
45 minutes Total Contact Session + 5 minutes for Attendance and Transition activities = 50 Minutes

SESSION NUMBER: 28
Session Outcome:Understand and apply Elgamal Digital Signatures
Time Teaching - Active
Topic BTL
(min) Learning Methods LearningMethods
PPT/ board and
10 Recapitulate 2
Marker
PPT/ board and Interactive Video
15 Elgamal Digital signature 2
Marker Sessions
PPT/ board and
15 Example 3
Marker
PPT/ board and
5 Overview 2
Marker
45 minutes Total Contact Session + 5 minutes for Attendance and Transition activities = 50 Minutes

PRACTICAL COMPONENT
List of Experiments supposed to finish in Open Lab Sessions:
Lab CO-
List of Experiments
session no Mapping
1 Implement Ceaser Cipher using C/Python CO1
CO 1
2 Implement Vigenere Cipher using C/Python
CO 1
3 Implement Playfair Cipher using C/Python
CO 1
4 Implement Hill Cipher using C/Python
CO 1
5 Implement Columnar Cipher using C/Python
CO 1
6 Implement Railfence transposition using C/Python

7 Implement S-DES using C/Python CO2


8 Implement Mix-column operation in AES C/Python CO2
9 Implement Secure Hash algorithm using C/Python CO3

10 Implement RSA algorithm using C/Python CO3


11 Implement Diffie Hellman key exchange algorithm using C/Python CO3
12 Implement Elgamal Digital Signature algorithm using C/Python CO4

WEEKLY HOMEWORK ASSIGNMENTS/ PROBLEM SETS/OPEN ENDEDED PROBLEM-


SOLVING EXERCISES etc.
Week Assignment Topic Details CO
2 HA-1 Crypt Analysis Attacks Various Types of Attacks like CO1
Chosen Plain text, Known plain text
6 HA-2 Modes of Operations OFB, Counter Mode CO2

15
9 HA-3 ECC Point on Curve Prime Curve and Binary Curve with CO3
an example
11 HA-4 Applications on SHA List various applications of SHA CO4
8 HA-5 Implement Euclidean To Find GCD of two Numbers CO5
Algorithm in C/Python

COURSE TIME TABLE


Course Conduct
Theory Lecture 4 Sections | 72 Students each | Class 2 Lectures per week
Room | Course Coordinator
Practical 4 Sections | 72 Students each | 3 Batches | 1 per week | each 2 hrs.
3 Instructors | 77 Computers 70 minutes Experiment |
30 minutes Evaluation for 25 students per instructor

Hour 1 2 3 4 5 6 7 8 9
Day Component 9:00-9:50 9:50-10:40 11:00-11:50 11:50-12:40 12:40-1:30 1:30-2:20 2:20-3:10 3:20-4:10 4:10-5:00
Theory
Mon Lab
Theory 17CS3175-L 17CS3175-L
Tue Lab
Theory
Wed Lab
Theory
Thu Lab 17CS3175-P
Theory
Fri Lab
Theory
Sat Lab 17CS3175-S

REMEDIAL CLASSES:
Supplement course handout, which may perhaps include special lectures and discussions that would be
planned, and schedule notified accordingly.

SELF-LEARNING:
Assignments to promote self-learning, survey of contents from multiple sources.

S.No Topics CO ALM References/MOOCS


1 Modes of CO1 Home https://www.coursera.org/learn/information-
Operation Assignment- security-data
2
2 Extended CO3 ALM-5 https://www.coursera.org/learn/information-
Euclidean security-data
Algorithm
3 Algorithm for CO3 ALM-4 https://www.coursera.org/learn/information-
Calculating security-data
Modulus

16
EVALUATION PLAN:

Evaluation Evaluation Assessment Duration


Weightage/Marks CO1 CO2 CO3 CO4 CO5
Type Component Dates (Hours)

Blooms Taxonomy Level


Weightage 10 4.5 4.5 1
Sem-In
Max Test 1 Dates 2
Exam-I 50M 21 21 8
Marks
Weightage 10 4.5 4.5 1
Sem-In
In-Semester Max Test 2 Dates 2
Exam -II 50M 21 21 8
Summative Marks
Evaluation Lab
Lab Internal Weightage 7.5 7.5
Total = 32.5 InternalSem-
Sem-In 1½
% Max In Exam
Exam 50M 50
Marks Dates
Weightage 5 1.25 1.25 1.25 1.25
Skilling
Skilling Max 1½
50 Exam 12.5 12.5 12.5 12.5
Marks
Weightage 5 1.25 1.25 1.25 1.25
ALMs Max Continuous Evaluation
120M 30 30 30 30
Marks
Home Weightage 2.5 0.5 0.5 0.5 0.5 0.5
Assignment Max Continuous Evaluation
Formative + Text Book 50M 10 10 10 10 10
Evaluation Marks
Total = Lab Weightage 5
17.5% 5
Continuous Continuous evaluation
Evaluation Max
100M 100
Marks
Weightage 5
Attendance Max Continuous evaluation
5M
Marks
Weightage 7.5 Lab External 7.5
SE Lab
Max 1½
Expt. 50M Dates 50
End- Marks
Semester Weightage 7.5 Lab External 1.875*4=7.5
Summative SE Skilling Max 1½
Evaluation 50 Dates 12.5 12.5 12.5 12.5
Marks
Total = 50% Weightage 35 End Sem 8.75 8.75 8.75 8.75
Semester
Max Exam 3 hrs
End Exam 100M 25 25 25 25
Marks Dates

ATTENDANCE POLICY
Every student is expected to be responsible for regularity of his/her attendance in class rooms and laboratories,
to appear in scheduled tests and examinations and fulfill all other tasks assigned to him/her in every course. For
Promotion, a Minimum of 40% of internal marks must be obtained. In every course, student has to maintain a
minimum of 75% attendance to be eligible for appearing in Semester end examination of the course, for cases of
medical issues and other unavoidable circumstances the students will be condoned if their attendance is between
65% to 75% in every course, subjected to submission of medical certificates, medical case file and other needful
documental proof to the concerned departments.

PLAGIARISM POLICY
Use of unfair means in any of the evaluation components will be dealt with strictly, and the case will be
reported to the examination committee.

17
COURSE TEAM MEMBERS, CHAMBER CONSULTATION HOURS AND CHAMBER
VENUE DETAILS:
Each instructor will specify his / her chamber consultation hours during which the student can contact him / her in
his / her chamber for consultation.

Chamber
Chamber Chamber
Consultation Signature of
S.No. Name of Faculty Consultation Consultation
Timings for each Course faculty
Day (s) Room No:
day
1 Mrs. V. Divya Every Friday 9:00 to 10:00 am C305

2 Dr. G. Swain Every Friday 9:00 to 10:00 am C505

3 Dr. Anantha Kumaran Every Friday 9:00 to 10:00 am C221


Mr. A. V. Praveen
4 Every Friday 9:00 to 10:00 am C405
Krishna

GENERAL INSTRUCTIONS
Students should come prepared for classes and carry the text book(s) or material(s) as prescribed by the Course
Faculty to the class.

NOTICES
Most of the notices are available on the LMS platform.
All notices will be communicated through the institution email.
All notices concerning the course will be displayed on the respective Notice Boards.

Signature of COURSE COORDINATOR:

Signature of Department Prof. Incharge Academics & Vetting Team Member:

HEAD OF DEPARTMENT:

Approval from: DEAN-ACADEMICS


(Sign with Office Seal)

18