Course Details
Subject {L-T-P / C} : CS6301 : Foundations of Computer Security { 3-0-0 / 3}
Subject Nature : Theory
Coordinator : Prof. Ramesh Kumar Mohapatra
Syllabus
Classical cryptography and overview: (3 hours)
Classical cryptosystems and their cryptanalysis, Model of secure communication, Security services, Overview of attacks, X.800 Security Architecture for Open System Interconnection (OSI), and cryptanalysis
Cryptographic Techniques: (5 hours)
Introduction to Substitution Techniques, Transposition Techniques, Encryption and decryption, Symmetric and Asymmetric Key Cryptography, Steganography, Key Range and Key Size.
Mathematical background: (4 hours)
Introduction to Number theory, Modular arithmetic, prime number generation, GCD, Euclidean Algorithm, Extended Euclidean Algorithm, Fast Exponentiation, Chinese Remainder Theorem, Fermat’s and Euler’s Theorem
Private key cryptography: (8hours)
Symmetric Encryption. Definitions. Chosen-Plaintext Attack. Chosen-Ciphertext Attack, Data Encryption Standard (DES), Advanced Encryption Standard (AES), Triple DES, Variations on DES - RC4, RC5 and Blowfish, Hash Functions. Message Authentication Codes. Collision-Resistance.
Public key cryptography: (8hours)
RSA, ElGamal, DSA, Elliptic curve cryptosystems, Public Key Cryptography standard (PKCS), PKI, Digital Certificates, and Key management techniques.
Course Objectives
- To develop a mathematical foundation for the study of cryptography.
- To Understand Number Theory and Algebra for design of cryptographic algorithms
- To understand the role of cryptography in communication over an insecure channel.
- To analyze and compare symmetric-key encryption public-key encryption schemes based on different security models
Course Outcomes
After reading this subject, students will be able to: <br />1. Understand modern concepts related to cryptography and cryptanalysis. <br />2. Analyze and use methods for cryptography and reflect about limits and applicability of these methods. <br />3. To define the system to protect determine the security properties that are desired for this system identify the possible threats to these security properties, their likelihood of occurrence and consider possible mitigations against these threats. <br />4. Describe and implement of some of the prominent techniques for public-key cryptosystems and digital signature schemes (e.g., Rabin, RSA, ElGamal, DSA, Schnorr) <br />5. Explain the notions of public-key encryption and digital signatures, and sketch their formal security definitions.
Essential Reading
- Behrouz A. Forouzan and D. Mukhopadhyay, Cryptography & Network Security, McGraw Hill, New Delhi. , 2nd Edition - 1st reprint 2010
- William Stallings, Cryptography and Network Security: Principles and Practice, Prentice Hall
Supplementary Reading
- Douglas R. Stinson, Cryptography: Theory and Practice, Chapman and Hall
- J. Katz and Y. Lindell, Introduction to Modern Cryptography, CRC press , 2008