JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD

Course Objectives:

• To understand the cryptography techniques
• To understand the protocols and information theory

UNIT - I

Foundations – Protocol Building Blocks - Basic Protocols - Intermediate Protocols - Advanced Protocols -Zero-Knowledge Proofs - Zero-Knowledge Proofs of Identity -Blind Signatures - Identity- Based Public-Key Cryptography - Oblivious Transfer - Oblivious Signatures - Esoteric Protocols

UNIT - II

Key Length - Key Management - Electronic Codebook Mode - Block Replay - Cipher Block Chaining Mode - Stream Ciphers - Self-Synchronizing Stream Ciphers - Cipher-Feedback Mode - Synchronous Stream Ciphers - Output-Feedback Mode - Counter Mode - Choosing a Cipher Mode - Interleaving - Block Ciphers versus Stream Ciphers - Choosing an Algorithm - PublicKey Cryptography versus Symmetric Cryptography - Encrypting Communications Channels - Encrypting Data for Storage - Hardware Encryption versus Software Encryption - Compression, Encoding, and Encryption - Detecting Encryption – Hiding and Destroying Information.

UNIT - III

Information Theory - Complexity Theory - Number Theory - Factoring - Prime Number Generation - Discrete Logarithms in a Finite Field - Data Encryption Standard (DES) – Lucifer -Madryga – New DES - GOST – 3 Way – Crab – RC5 - Double Encryption - Triple Encryption - CDMF Key Shortening - Whitening.

UNIT - IV

Pseudo-Random-Sequence Generators and Stream Ciphers – RC4 - SEAL - Feedback with Carry Shift Registers - Stream Ciphers Using FCSRs - Nonlinear-Feedback Shift Registers - System- Theoretic Approach to Stream-Cipher Design - Complexity-Theoretic Approach to Stream-Cipher Design - N- Hash - MD4 - MD5 - MD2 - Secure Hash Algorithm (SHA) – One Way Hash Functions Using Symmetric Block Algorithms - Using Public-Key Algorithms - Message Authentication Codes

UNIT - V

RSA - Pohlig-Hellman - McEliece - Elliptic Curve Cryptosystems -Digital Signature Algorithm (DSA) - Gost Digital Signature Algorithm - Discrete Logarithm Signature Schemes - Ongchnorr-Shamir - Cellular Automata - Feige-Fiat-Shamir -Guillou-Quisquater - Diffie-Hellman - Station-to-Station Protocol -Shamir’s Three-Pass Protocol - IBM Secret-Key Management Protocol - MITRENET - Kerberos - IBM Common Cryptographic Architecture.

(Subject may be taught with implementation through JAVA)

REFERENCES

• 1. Bruce Schneier, “Applied Cryptography: Protocols, Algorithms, and Source Code in C” John Wiley & Sons, Inc, 2nd Edition, 1996.
• 2. Wenbo Mao, “Modern Cryptography Theory and Practice”, Pearson Education, 2004
• 3. Atul Kahate, “Cryptography and Network Security”, Tata McGrew Hill, 2003.
• 4. William Stallings, “Cryptography and Network Security, Prentice Hall, New Delhi, 2006.
• 5. Bernard Menezes, “Network Security and Cryptography”, Cengage Learning, New Delhi, 2010. M. Tech- I Year – I Semester (Cyber Forensics & Information Security/Cyber Security)