DSC-839
MS
Information Cryptography
(DE) Domain Elective
Theory: 3 Cr. Hrs
Total: 3 Cr. Hrs
Introduction to Nondeterministic and deterministic cryptography, Computationally secure encryption, Asymptotic ciphers, Computational Indistinguishability, Symmetric multi-party computation, Searchable encryption, Secure multiparty computation, Oblivious data transfer, Shannon perfect security, Linear and Nonlinear feedback shift registers, Block ciphers structures, Design and analysis of block ciphers primitives, Design and analysis of stream cipher primitives, Design and analysis of collision resistant hashing algorithms, Differential and Linear Cryptanalysis, Attacks on block ciphers, Attacks on stream ciphers, Partitioning cryptanalysis, Brute-force attacks, Plaintext attacks, Man in middle attack, Chosen plaintext attack, Known key attack, Ciphertext-only attack, Non-deterministic and deterministic random bit generator, Statistical randomness evaluation, Key generation, Key distribution centre, Factorization of polynomials, Gröbner basis algorithms, Shor's basis algorithm, Digital signature standard, Merkle–Hellman knapsack cryptosystem, Public key exchange, Zero-Knowledge Cave, Certification authorities.
In Programmes
MS
MS (Data Science)
Electives Pool —
Elective (Current Scheme)