CRYPTOGRAPHY AND NETWORK SECURITY

Paper Code: 
MCA 321
Credits: 
04
Periods/week: 
04
Max. Marks: 
100.00
Objective: 

Max. Marks: 100.00

 

Course Objectives:

This course enables the students to

  1. Understand the fundamentals of Cryptography
  2. Understand how to deploy encryption techniques to secure data in transit across data

3.     Acquire knowledge on standard algorithms used to provide confidentiality, integrity and Authenticity

  1. Analyze and use methods for cryptography

5.     Reflect about limits and applicability of methods

 

Course Outcomes(COs):

 

Learning Outcome (at course level)

 

Learning and teaching strategies

Assessment Strategies

 
 

CO125.        Classify the various classical    encryption techniques

CO126.        Illustrate various Public key cryptographic techniques

CO127.        Discuss key exchange and authentication applications

CO128.        Evaluate the authentication and hash algorithms

CO129.        Summarize the intrusion detection and its solutions to overcome the attacks.

 

Interactive Lectures,

Modelling, Discussions, using research papers, student centred approach, Through Video Tutorials

 

Learning activities for the students:

Experiential Learning, Presentations, case based learning, Discussions, Quizzes and  Assignments

·  Assignments

·  Written test in classroom

·  Classroom activity

·  Continues Assessment

·  Semester End Examination

 

 

 

14.00
Unit I: 
Introduction to security attacks

Introduction to security attacks: services and mechanism, classical encryption techniques- substitution ciphers and transposition ciphers, cryptanalysis, stream and block ciphers. Modern Block Ciphers: Block ciphers principals, Shannon’s theory of confusion and diffusion, fiestal structure, data encryption standard (DES), differential and linear cryptanalysis of DES, block cipher modes of operations, triple DES

12.00
Unit II: 
Encryption Technique

Encryption Technique: AES, RC6, random number generation. S-box theory: Boolean Function, S-box design criteria, Bent functions, Propagation and nonlinearity, construction of balanced functions, S-box design.

14.00
Unit III: 
Public Key Cryptosystems

Public Key Cryptosystems: Principles of Public Key Cryptosystems, RSA Algorithm, security analysis of RSA, Exponentiation in Modular Arithmetic. Key Management in Public Key Cryptosystems: Distribution of Public Keys, Distribution of Secret keys using Public Key Cryptosystems. X.509 Discrete Logarithms, Diffie-Hellman Key Exchange

10.00
Unit IV: 
Message Authentication and Hash Function

Message Authentication and Hash Function: Authentication requirements, authentication functions, message authentication code, hash functions, birthday attacks, security of hash functions and MAC, MD5 message digest algorithm, Secure hash algorithm(SHA). Digital Signatures: Digital Signatures, authentication protocols, digital signature standards (DSS), proof of digital signature algorithm. Remote user Authentication using symmetric and Asymmetric Authentication

10.00
Unit V: 
Pretty Good Privacy

Pretty Good Privacy. IP Security: Overview, IP Security Architecture, Authentication Header, Encapsulation Security Payload in Transport and Tunnel mode with multiple security associations (Key Management not Included). Strong Password Protocols: Lamport’s Hash, Encrypted Key Exchange.

ESSENTIAL READINGS: 

  • Stalling Williams: Cryptography and Network Security: Principles and Practices, 4th Edition, Pearson Education, 2006.
  • Kaufman Charlie et.al; Network Security: Private Communication in a Public World, 2nd Ed., PHI/Pearson, 2002.

REFERENCES: 

  • Pieprzyk Josef and et.al; Fundamentals of Computer Security, Springer-Verlag, 2008.
  • Trappe & Washington, Introduction to Cryptography, 2nd Ed. Pearson, 2006

Academic Year: 
2022-23
  • Printer-friendly version