22CSE425 Cryptography L T P S/O C
Version 1.0 2 0 2 0 3
Pre-requisites/Exposure Windows PC, a Mac or a Linux Computer
Basic understanding of Mathematics (Class 12th level)
Co-requisites None
Course Objectives
1. To understand Cryptography Theories, Algorithms and Systems.
2. To understand necessary Approaches and Techniques to build protection
mechanisms in order to secure computer networks.
Course Learning Outcomes (CLOs)
On completion of this course, the students will be able to:
CLO1. Understand the fundamentals of networks security, security
architecture, threats and vulnerabilities
CLO2. Apply the different cryptographic operations of symmetric
cryptographic algorithms
CLO3. Apply the various Authentication schemes to simulate different
applications.
CLO4. Understand various Security practices and System security standards
Course Content
Unit – I (INTRODUCTION)
5 Lecture Hours
Security trends – Legal, Ethical and Professional Aspects of Security, Need for Security at
Multiple levels, Security Policies – Model of network security – Security attacks, services and
mechanisms – OSI security architecture – Classical encryption techniques: substitution
techniques, transposition techniques, steganography- Foundations of modern cryptography:
perfect security – information theory – product cryptosystem – cryptanalysis.
Unit – II (SYMMETRIC KEY CRYPTOGRAPHY) 5
Lecture Hours
MATHEMATICS OF SYMMETRIC KEY CRYPTOGRAPHY: Algebraic structures –
Modular arithmetic-Euclid‟s algorithm- Congruence and matrices -Groups, Rings, Fields-
Finite fields- SYMMETRIC KEY CIPHERS: SDES – Block cipher Principles of DES –
Strength of DES – Differential and linear cryptanalysis – Block cipher design principles –
Block cipher mode of operation – Evaluation criteria for AES – Advanced Encryption Standard
– RC4 – Key distribution.
Unit – III (PUBLIC KEY CRYPTOGRAPHY)
5 Lecture Hours
MATHEMATICS OF ASYMMETRIC KEY CRYPTOGRAPHY: Primes – Primality Testing
–Factorization – Euler‘s totient function, Fermat‘s and Euler‘s Theorem – Chinese Remainder
Theorem – Exponentiation and logarithm – ASYMMETRIC KEY CIPHERS: RSA
cryptosystem – Key distribution – Key management – Diffie Hellman key exchange -ElGamal
cryptosystem – Elliptic curve arithmetic-Elliptic curve cryptography.
Unit – IV (MESSAGE AUTHENTICATION AND INTEGRITY) 5 Lecture Hours
Authentication requirement – Authentication function – MAC – Hash function – Security of
hash function and MAC – SHA –Digital signature and authentication protocols – DSS- Entity
Authentication: Biometrics, Passwords, Challenge Response protocols- Authentication
applications – Kerberos, X.509
Unit – V (SECURITY PRACTICE AND SYSTEM SECURITY) 4
Lecture Hours
Electronic Mail security – PGP, S/MIME – IP security – Web Security – SYSTEM
SECURITY: Intruders – Malicious software – viruses – Firewalls.
Text Books
1. Allen B. William Stallings, Cryptography and Network Security: Principles and
Practice, PHI 3rd Edition, 2006.
Reference Books
1. C K Shyamala, N Harini and Dr. T R Padmanabhan: Cryptography and Network
Security, Wiley India Pvt.Ltd
2. BehrouzA.Foruzan, Cryptography and Network Security, Tata McGraw Hill 2007.
3. Charlie Kaufman, Radia Perlman, and Mike Speciner, Network Security: PRIVATE
Communication in a PUBLIC World, Prentice Hall, ISBN 0-13-046019-2
Modes of Evaluation: Assignment/ Quiz / Seminar / Written ExaminationExamination
Scheme:
Components Internal End Semester Examination Total
Weightage (%) 60% 40% 100%
