Course Details
Subject {L-T-P / C} : CS4212 : Cryptographic Foundation { 3-0-0 / 3}
Subject Nature : Theory
Coordinator : Prof.(Ms.) Sujata Mohanty
Syllabus
Detailed syllabus
Unit I
Classical cryptography and overview: 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
Unit II
Cryptographic Techniques: Introduction to Substitution Techniques, Transposition Techniques, Encryption and decryption, Symmetric and Asymmetric Key Cryptography, Steganography, Key Range and Key Size.
Unit III
Mathematical background: Introduction to Number theory, Modular arithmetic, prime number generation, GCD, Euclidean Algorithm, Extended Euclidean Algorithm, Chinese Remainder Theorem, Fermat’s and Euler’s Theorem
Unit IV
Private key cryptography: 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.
Unit V
Public key cryptography: RSA, ElGamal, DSA, Elliptic curve cryptosystems, Public Key Cryptography standard(PKCS), PKI, Digital Certificates, and Key management techniques.
Unit VI
Security Protocols: Authentication: Kerberos, X.509 Authentication Service, Secure Socket Layer(SSL), Secure Electronic Transaction(SET), Email security,: PGP, S/MIME, IP Security (IPSec)
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.
- Analyse and compare symmetric-key encryption public-key encryption schemes based on different security models
Course Outcomes
• Understand modern concepts related to cryptography and cryptanalysis. <br />• Analyze and use methods for cryptography and reflect about limits and applicability of these methods. <br />• Should be able 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 />• Describe and implement the specifics of some of the prominent techniques for public-key cryptosystems and digital signature schemes (e.g., Rabin, RSA, ElGamal, DSA, Schnorr) <br />• 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 , 2nd Edition - 1st reprint 2010
- J. Katz and Y. Lindell, , Introduction to Modern Cryptography, CRC press
Supplementary Reading
- Stinson, D. R., Cryptography: Theory and Practice, Chapman and Hall
- • Wade Trapple, Lawrence C. Washington, Introduction to Cryptography with coding Theory, Pearson Education , 2nd Edition