MNIT Jaipur Syllabus computer science Cryptography

 

MNIT Jaipur Syllabus computer science   Cryptography

 

Cryptography

Review of Number theory: Prime numbers, modular arithmetic, Fermat’s theorem, Euler’s theorem,Chinese remainder theorem, Discrete logarithms, Random number generation, factoring, prime number

generation.

Cryptography: Need, conventional techniques, stream ciphers, block cipher, steganography. Public v/s

private key cryptography.

Stream Ciphers: Caesar Cipher, mono-alphabetic and poly-alphabetic ciphers, Playfair Cipher, Hill

Cipher, Rotor machines, One time pad,.

Random Number Generation: Pseudo Random Number, PRNG, LFSR, Blum-Blum Shub generator

Private-key cryptography: Feistel structure, DES (Data encryption standard), design of S-boxes, AES,

Triple DES.

Public key cryptography: Key management, Key exchange – Diffie-Hellman, El-Gamal, Merkle’s

Puzzle, Authentication, Signatures, Deniability, RSA.

Threshold Cryprography: Sharing Secrets.

Digital Signature: DSA and its variants, discrete logarithm based digital signatures.

One-way hash functions – MD5, SHA (Secure Hash Algorithm).

Cryptanalysis: Differential and linear cryptanalysis – cracking DES.

Text/References:

1. Stallings, Cryptography and Network Security: Principles and Practice, Pearson Education Asia.

ISBN 981-403-589-0.

2. B Schneier, Applied Cryptography, Wiley. ISBN 0-471-11709-9

3. D Kahn. The Codebreakers, Sphere books. ISBN 0-7221-51497

4. P Wayner, Disappearing Cryptography, Academic Press. ISBN 0-12-738671-8

5. Cracking DES, Electronic Frontier Foundation. ISBN 1-56592-520-3

6. A.J. Menezes, P.C. van Oorschot and S.A. Vanstone, Applied Cryptography, CRC Press, ISBN

0-8493-8523-7, 1997

7. D.R. Stinson, Cryptography – Theory and practice, CRC Press, ISBN 0-8493-8521-0, 1995

Leave a Comment