Syllabus - Data Security (CY503 (C))

Introduction

History of Cryptography. Mathematical background: Probability theory - theory. Symmetric (Private) Key theory, Number Information Cryptographic Systems: Caesar – Aff ine – Monoalphabetic Substitution – Transposition – Homophonic substitution – Vignere – Beauford and DES Family – Product ciphers – Lucifer and DES.

Asymmetric (Public) Key Cryptographic Systems

Concept of PKCS, RSA Cryptosystem- Variants of RSA – Primality testing – Security of RSA – Merkle – Hellamn – Security of Merkle – Hellaman, ElGamal. Elliptical Curve Cryptography.

Stream ciphers and block ciphers

The one time pad – Synchronous stream ciphers – Self-synchronizing stream ciphers – Feedback shift registers – Linear Complexity – Non-linear feedback shift registers – Stream ciphers based LFSRs. Non-linear Combination generators – Non linear filter generators – Clock controlled generators – The alternating step generators – The shrinking generators.

Digital Signatures

Properties, Generic signature schemes – Rabin Lamport – Matyasmeyer, RSA – Multiple RSA and ElGamal Signatures – Digital signature standard – Blind Signatures- RSA Blind.

Secret Sharing Algorithms

Threshold secret sharing – Shamir scheme, Blakley scheme and modular Scheme. Pseudo random number generators: Definition of randomness and pseudo-randomness – Statistical tests of randomness – Linear congruential generator – Modern PRNGs (a brief description).