L

T

P

C

3

1

2

5

• Introduce students to the concepts, technologies, practices and challenges associated with Information Security and Privacy.
• Introduce the principles and practice of cryptography and network security.
• Examine schemes in different standards, and evaluate their use in different situations.

• Understand the concepts related to the basics of cryptography and computer security.
• Deduce the mechanisms to be employed while trying to satisfy any of the security services
• Apply the concept of security services and mechanisms from the application developers and network administrator’s perspective.

(02 Hours)

(04 Hours)

Finite fields, Arithmetic and algebraic algorithms

(02 Hours)

(04 Hours)

Perfect secrecy, Semantic security, IND-CPA, IND-CCA

(04 Hours)

One time pad, Security proof of one time pad

(04 Hours)

Need for block ciphers, Luby-rackoff construction and its security proof, Modes of operation

(04 Hours)

Definitions, Notions of security and unaffordability (EUF-CMA), Merkle-Damgard family of hash functions

(04 Hours)

Discrete logarithm, Factorization

(06 Hours)

Diffie Hellman, RSA encryption; Proofs of security under hardness assumptions, Digital Signature

(03 Hours)

(03 Hours)

(02 Hours)

(Total Contact Time: 42 Hours + 14 Hours = 56 Hours)

1. Implementation of Client side scripting
2. Implementation of Server side scripting
3. Implementation of mini project using above technology including the database connectivity

1. Dhiren Patel, Information Security: Theory and Practice, PHI, 2008/2010
2. William Stallings, "Cryptography and Network Security - Principles and Practice", 6/E, Pearson Education, 2013.
3. Douglas Stinson: "Cryptography: Theory and Practice, Third Edition", 3/E, Chapman and Hall/CRC, 2005
4. Menezes Bernard, Network Security and Cryptography, Cengage Learning India, 2010
5. Alfred. J. Menezes, Paul C. van Oorschot, Scott A. Vanstone: "Handbook of Applied Cryptography", 1/E, CRC, 1996