Page 55 - B.E CSE Curriculum and Syllabus R2017 - REC

Department of CSE, REC

OUTCOMES:
On successful completion of this course, the student will be able to:
● Understand applications of Graphics and basic primitives of graphics,
● Gain proficiency in various algorithms of 2D Computer graphics and trend their use in various real-
life systems.
● Enhance the perspective of Modern computer system with modelling, analysis and interpretation of
3D visual information.
● Apply Illumination, color models and design animation sequences.
● Able to understand different forms of Multimedia and gain knowledge about Audio and Video.

TEXT BOOKS:
1. Donald Hearn and M. Pauline Baker, Computer Graphics C Version, Second Edition, Pearson
Education.
2. Prabat K Andleigh and Kiran Thakrar, Multimedia Systems and Design, PHI, First Edition, 2003

REFERENCES:
1. John F. Hughes, Andries Van Dam, Morgan McGuire, David F. Sklar, James D. Foley, Steven K.
Feiner and Kurt Akeley, Computer Graphics: Principles and Practice, Third Edition, Addison-Wesley
Professional,2013.
2. John F. Koegel Buford, Multimedia Systems, Pearson Education, Delhi, Sixth Edition, 2009
3. Ralf Steinmetz and Klara Multimedia Computing, Communications and Applications, Pearson
Education, First Edition, 2009
4. http://nptel.ac.in/

CS17504 CRYPTOGRAPHY AND NETWORK SECURITY L T P C
(Common to B.E. CSE and B.Tech. IT) 3 0 0 3

OBJECTIVES:
● Basics of encryption and Number Theory.
● Methods of public key encryption.
● Authentication and hash functions.
● Techniques of system level securities.
● Current trends on wireless security.

UNIT I INTRODUCTION & NUMBER THEORY 9
Services, Mechanisms and attacks-the OSI security architecture-Network security model-Classical Encryption
techniques (Symmetric cipher model, substitution techniques, transposition techniques, steganography)-Finite
Fields and Number Theory: Modular arithmetic- Euclid’s algorithm-Finite fields- Polynomial Arithmetic –
Prime numbers-Fermat’s and Euler’s theorem- Testing for primality -The Chinese Remainder theorem-
Discrete logarithms.

UNIT II BLOCK CIPHERS & PUBLIC KEY CRYPTOGRAPHY 9
Data Encryption Standard-Block cipher principles-block cipher modes of operation-Advanced Encryption
Standard (AES)-Triple DES. Public key cryptography: Principles of public key cryptosystems-The RSA
algorithm-Key management-Attacks on RSA - Diffie Hellman Key exchange- Elliptic curve arithmetic-
Elliptic curve cryptography - Side channel analysis- side channel attacks.

UNIT III HASH FUNCTIONS AND DIGITAL SIGNATURES 9
Authentication requirement – MAC – Hash function – MD5 - SHA - HMAC –-Digital signature and
authentication protocols – DSS– Blockchain - Case Study: Bitcoin – Ethereum – Zcash.

Curriculum and Syllabus | B.E. Computer Science and Engineering | R2017 Page 55