__CRYPTOGRAPHY__

__Course Code : 18EC744 __

CIE Marks :40

Lecture Hours/Week :03

SEE Marks :60

Total Number of Lecture Hours : 40 (08 Hrs / Module)

Exam Hours :03

CREDITS — 03

CIE Marks :40

Lecture Hours/Week :03

SEE Marks :60

Total Number of Lecture Hours : 40 (08 Hrs / Module)

Exam Hours :03

CREDITS — 03

__Course Learning Objectives: This course will enable students to:__

- Understand the basics of symmetric key and public key cryptography.
- Explain classical cryptography algorithms.
- Acquire knowledge of mathematical concepts required for cryptography.
- Describe pseudo random sequence generation technique.
- Explain symmetric and asymmetric cryptography algorithms.

__Module -1__

Classical Encryption Techniques: Symmetric cipher model, Substitution techniques, Transposition techniques (Text 1: Chapter 1) Basic Concepts of Number Theory and Finite Fields: Euclidean algorithm, Modular arithmetic (Text 1: Chapter 3) L1,L2### Click here to download Module-1

__Module -2__

SYMMETRIC CIPHERS: Traditional Block Cipher structure, Data encryption standard (DES), The AES Cipher. (Text 1: Chapter 2: Sectionl, 2, Chapter 4:Section 2, 3, 4) L1,L2__Module -3__

Basic Concepts of Number Theory and Finite Fields: Groups, Rings and Fields, Finite ﬁelds of the form GF(p), Prime Numbers, Fermat’s and Euler’s theorem, discrete logarithm. (Text 1: Chapter 3 and Chapter 7: Section 1, 2, 5), L1,L2__Module -4__

ASYMMETRIC CIPHERS: Principles of Public-Key Cryptosystems, The RSA algorithm, Difﬁe - Hellman Key Exchange, Elliptic Curve Arithmetic, Elliptic Curve Cryptography (Text 1: Chapter 8, Chapter 9: Section 1, 3, 4) L1,L2,L3__Module -5__

Pseudo-Random—Sequence Generators and Stream Ciphers: Linear Congruential Generators, Linear Feedback Shift Registers, Design and analysis of stream ciphers, Stream ciphers using LFSRs, A5, Hughes XPD/ KPD, Nanotech, Rambutan, Additive generators, Giﬁbrd, Algorithm M,PKZIP (Text 2: Chapter 16), L1,L2, L3### Click here to download Module-5

__Course Outcomes: After studying this course, students will be able to:__

1. Explain basic cryptographic algorithms to encrypt and decrypt the data.2. Use symmetric and asymmetric cryptography algorithms to encrypt and decrypt the information.

3. Describe the mathematics associated with cryptography.

4. Apply concepts of modern algebra in cryptography algorithms.

5. Apply pseudo random sequence in stream cipher algorithms.

__Question paper pattern:__

- Examination will be conducted for 100 marks with question paper containing 10 full questions, each of 20 marks.
- Each ﬁll] question can have a maximum of 4 sub questions.
- There will be 2 full questions from each module covering all the topics of the module.
- Students will have to answer 5 ﬁlll questions, selecting one full question from each module.
- The total marks will be proportionally reduced to 60 marks as SEE marks is 60.

__Text Books:__

1. William Stallings, “Cryptography and Network Security Principles and Practice”, Pearson Education Inc., 6th Edition, 2014, ISBN: 978-93- 325-1877-3__Click here to download Textbook1__

2. Bruce Schneier, “Applied Cryptography Protocols, Algorithms, and Source code in C”, VVlley Publications, 2nd Edition, ISBN: 997 1-51-348-X.

__Reference Books:__

1. Cryptography and Network Security, Behrouz A. Forouzan, TMH, 2007.2. Cryptography and Network Security, Atul Kahate, TMH, 2003.

## 0 Comments