Course

Unit 1:

Introduction to Probability Theory– Information Theory – Complexity Theory and Number Theory – Private-Key – Cryptosystems – Classical Ciphers – DES Family – Product Ciphers – Lucifer Algorithm – Modern Private Key Cryptographic Algorithms – Differential Cryptanalysis – Linear Cryptanalysis – S-box Theory – Propagation and Nonlinearity – Construction of Balanced Functions.

Unit 2:

Public-Key Cryptosystems – RSA Cryptosystem – Merkle-Hellman Cryptosystem – McEliece Cryptosystem – ElGamal Cryptosystem – Elliptic Curve Cryptosystems – Probabilistic Encryption – Pseudo-Randomness – Polynomial Indistinguishability – Pseudorandom Bit Generators – Pseudorandom Function Generators – Super Pseudorandom Permutation Generators – Hashing – Theoretic Constructions – Hashing based on Cryptosystems – MD Family – SHA Family – Keyed Hashing.

Unit 3:

Digital Signature – Generic Signature Schemes –RSA Signatures – Elgamal Signatures – Blind Signatures – Undeniable Signatures – Fail-Stop Signatures – Time Stamping – Secret Sharing – Threshold Secret Sharing (T, T) –Threshold Schemes – Shamir Scheme – Blakley Scheme – Modular Scheme – General Secret Sharing – Stream Ciphers – Linear Complexity – Non Linear Feedback Shift Registers-VLSI Implementation of some of the Cryptographic algorithms.

Course Objectives

• To provide basic knowledge and skills in the fundamental theories and practices of data security.
• To provide an overview of the field of security and emphasizing the need to protect information being transmitted electronically.
• To provide an understanding of the different cryptographic algorithms.
• To realize the hardware architectures of cryptographic algorithms

Course Outcomes: At the end of the course, the student should be able to

• CO1: Understand the mathematical fundamental concepts needed for cryptographic algorithm implementations.
• CO2: Apply concepts of security to computing systems
• CO3: Analyze cryptosystems architecture, digital signature algorithms and secure data sharing techniques
• CO4: Evaluate the implementation of cryptographic algorithms in FPGA.

Skills Acquired: Ability to use cryptographic algorithms for data security.

CO-PO Mapping:

1. Josef Pieprzyk, Thomas Hardjono and Jennifer Seberry, Fundamentals of Computer Security, Springer, 2003.
2. Alfred J. Menezes, Paul C. Van Oorschot and Scott A. Vanstone, Handbook of Applied Cryptography, CRC Press, 1996.
3. Abhijith Das and VeniMadhavanC. E., Public-key Cryptography, Theory and Practice, Pearson Education, 2009.
4. Jonathan Katz and Yehuda Lindell, Introduction to Modern Cryptography, Third Edition, CRC Press, 2020.
5. Christof Paar, Jan Pelzl, Understanding Cryptography: A Textbook for Students and Practitioners, Springer, 2014.