CRYPTOGRAPHY (18CS744)

CRYPTOGRAPHY

Course Code:18CS744
CIE Marks:40
Number of Contact Hours/Week:3:0:0
SEE Marks:60
Total Number of Contact Hours:40
Exam Hours:03
CREDITS –3

Course Learning Objectives: This course (18CS744) will enable students to:

• Define cryptography and its principles
• Explain Cryptography algorithms
• Illustrate Public and Private key cryptography
• Explain Key management, distribution and ceritification
• Explain authentication protocols
• Tell about IPSec

Module – 1

Classical Encryption Techniques Symmetric Cipher Model, Cryptography, Cryptanalysis and Brute-Force Attack, Substitution Techniques, Caesar Cipher, Monoalphabetic Cipher, Playfair Cipher, Hill Cipher, Polyalphabetic Cipher, One Time Pad. 

Block Ciphers and the data encryption standard: Traditional block Cipher structure, stream Ciphers and block Ciphers, Motivation for the feistel Cipher structure, the feistel Cipher, The data encryption standard, DES encryption, DES decryption, A DES example, results, the avalanche effect, the strength of DES, the use of 56-Bit Keys, the nature of the DES algorithm, timing attacks, Block cipher design principles, number of rounds, design of function F, key schedule algorithm
Textbook 1: Ch. 2.1,2.2, Ch. 3
RBT: L1, L2

Notes will be uploaded soon

Module – 2

Public-Key Cryptography and RSA: Principles of public-key cryptosystems. Public-key cryptosystems. Applications for public-key cryptosystems, requirements for public-key cryptosystems. public-key cryptanalysis. The RSA algorithm, desription of the algorithm, computational aspects, the security of RSA.

Other Public-Key Cryptosystems: Diffie-hellman key exchange, The algorithm, key exchange protocols, man in the middle attack,Elgamal Cryptographic systems
Textbook 1: Ch. 9, Ch. 10.1,10.2
RBT: L1, L2

Notes will be uploaded soon

Module – 3

Elliptic curve arithmetic, abelian groups, elliptic curves over real numbers, elliptic curves over Zp, elliptic curves overGF(2m), Elliptic curve cryptography, Analog of Diffie-hellman key exchange, Elliptic curve encryption/ decryption, security of Elliptic curve cryptography, Pseudorandom number generation based on an asymmetric cipher, PRNG based on RSA.

Key Management and Distribution: Symmetric key distribution using Symmetric encryption, A key distribution scenario, Hierarchical key control, session key lifetime, a transparent key control scheme, Decentralized key control, controlling key usage, Symmetric key distribution using asymmetric encryption, simple secret key distribution, secret key distribution with confidentiality and authentication, A hybrid scheme, distribution of public keys, public announcement of public keys, publicly available directory,public key authority, public keys certificates.
Textbook 1: Ch. 10.3-10.5, Ch.14.1 to 14.3
RBT: L1, L2

Notes will be uploaded soon

Module – 4

X-509 certificates. Certificates, X-509 version 3, public key infrastructure .
User Authentication: Remote user Authentication principles, Mutual Authentication, one wayAuthentication, remote user Authentication using Symmetric encryption, Mutual Authentication, one way Authentication, Kerberos, Motivation , Kerberos version 4, Kerberos version 5, Remote user Authentication using Asymmetric encryption, Mutual Authentication, one way Authentication. 

Electronic Mail Security: Pretty good privacy, notation, operational; description, S/MIME, RFC5322, Multipurpose internet mail extensions, S/MIME functionality, S/MIME messages, S/MIME certificate processing, enhanced security services, Domain keys identified mail, internet mail architecture, E-Mail threats, DKIM strategy, DKIM functional flow.
Textbook 1: Ch. 14.4, Ch. 15.1 to 15.4, Ch.19
RBT: L1, L2

Notes will be uploaded soon

Module – 5

IP Security: IP Security overview, applications of IPsec, benefits of IPsec, Routing applications, IPsec documents, IPsec services, transport and tunnel modes, IP Security policy, Security associations, Security associations database, Security policy database, IP traffic processing, Encapsulating Security payload, ESP format, encryption and authentication algorithms, Padding, Anti replay service
Transport and tunnel modes, combining security associations, authentication plus confidentiality, basic combinations of security associations, internet key exchange, key determinations protocol, header and payload formats, cryptographic suits.
Textbook 1: Ch. 20.1 to 20.3
RBT: L1, L2

Notes will be uploaded soon

Course outcomes: The students should be able to:

• Define cryptography and its principles
• Explain Cryptography algorithms
• Illustrate Public and Private key cryptography
• Explain Key management, distribution and ceritification
• Explain authentication protocols
• Tell about IPSec

Question paper pattern:

• The question paper will have ten questions.
• There will be 2 questions from each module.
• Each question will have questions covering all the topics under a module.
• The students will have to answer 5 full questions, selecting one full question from each module.

Text Books: 

1. William Stallings: Cryptography and Network Security, Pearson 6th edition.

Reference Books: 

1. V K Pachghare: Cryptography and Information Security, PHI 2nd Edition.