ECE4013 Cryptography and Network Security L T P J C

3 0 0 0 3
Prerequisite: ECE2005 Probability Theory and random process
v.1.2
Objectives:
 This course will help to know about the techniques for security of networks. They will
know about data encryption and decryption.
Outcomes:
1. Will train the students on how to secure the networks
Student Learning Outcomes (SLO): 1,2,18

Module:1 Classical Encryption Techniques: 5 hours SLO: 2

Introduction, Security Services and Mechanisms, Classical Encryption Techniques

Module:2 Mathematical Foundations: 6 hours SLO: 1

Number Theory and Finite Fields, Principles of Pseudorandom Number Generation, Fermat’s and
Euler’s Theorems, The Chinese Remainder Theorem, Discrete Logarithms, Elliptic Curve
Arithmetic

Module:3 Symmetric Ciphers: 8 hours SLO: 18

Block Ciphers and encryption standards - DES, AES, Pseudorandom Number Generation, Stream
Ciphers, Public-Key Cryptography - RSA

Module:4 Asymmetric Ciphers: 6 hours SLO: 18

Diffie-Hellman Key Exchange, ElGamal Cryptosystem, Elliptic Curve Cryptography,
Pseudorandom Number Generation Based on an Asymmetric Cipher

Module:5 Data Integrity: 6 hours SLO: 2

Cryptographic Hash Functions, Message Authentication Codes

Module:6 Mutual Trust: 6 hours SLO: 2

Digital Signatures, Key Management and Distribution, User Authentication Protocols

Module:7 Network Security: 6 hours SLO: 18

Transport-Level Security, WLAN Security – Firewalls, Web Security, Software Security, IoT
threats, Security issue in Cognitive Networks, constraints and challenges

Module:8 Contemporary issues: 2 hours

Total Lecture: 45 hours

Text Books:
1. William Stallings, "Cryptography and Network security: Principles and Practice", 5th Edition,
 2014, Pearson Education, India.

Reference Books:
1. Christof Paar and Jan Pelzl, “Understanding Cryptography – A Textbook for Students and
Practitioners”, Springer, 2014.
2. Behrouz A.Forouzan : Cryptography & Network Security – The McGraw Hill Company,
2010.

Approved by Academic Council No.:47 Date:05.10.2017