SATHYABAMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

L T P Credits Total Marks

SCSA1315 INTRODUCTION TO CRYPTOGRAPHY
2 0 0 2 100

COURSE OBJECTIVES
➢ To Learn about modern Cryptography.
➢ To focuses on how cryptographic algorithms and protocols work and how to use them
➢ To build a Pseudorandom permutation
➢ To Construct Basic cryptanalytic techniques
➢ To provide instruction on how to use the concepts of block ciphers and message authentication codes

UNIT 1 INTRODUCTION 9Hrs.

Basics of Symmetric Key Cryptography, Basics of Asymmetric Key Cryptography, Hardness of Functions. Notions of Semantic Security (SS) and
Message Indistinguishability (MI): Proof of Equivalence of SS and MI, Hard Core Predicate, Trap-door permutation, Goldwasser-Micali Encryption.
Goldreich-Levin Theorem: Relation between Hardcore Predicates and Trap-door permutations.

UNIT 2 FORMAL NOTIONS OF ATTACKS 9Hrs.

Attacks under Message Indistinguishability: Chosen Plaintext Attack (IND-CPA), Chosen Ciphertext Attacks (IND-CCA1 and IND-CCA2), Attacks under
Message Non-malleability: NM-CPA and NM-CCA2, Inter-relations among the attack model

UNIT 3 RANDOM ORACLES 9Hrs.

Provable Security and asymmetric cryptography, hash functions. One-way functions: Weak and Strong one-way functions. Pseudo-random Generators
(PRG): Blum-Micali-Yao Construction, Construction of more powerful PRG, Relation between One-way functions and PRG, Pseudo-random Functions
(PRF)

UNIT 4 BUILDING A PSEUDORANDOM PERMUTATION 9Hrs.

The Luby Rackoff Construction: Formal Definition, Application of the Luby Rackoff Construction to the construction of Block Ciphers, The DES in the light
of Luby Rackoff Construction.

UNIT5 MESSAGE AUTHENTICATION CODES 9Hrs.

Left or Right Security (LOR). Formal Definition of Weak and Strong MACs, Using a PRF as a MAC, Variable length MAC. Public Key Signature
Schemes: Formal Definitions, Signing and Verification, Formal Proofs of Security of Full Domain Hashing. Assumptions for Public Key Signature
Schemes: One-way functions Imply Secure One-time Signatures. Shamir's Secret Sharing Scheme. Formally Analysing Cryptographic Protocols. Zero
Knowledge Proofs and Protocols.
Max. 45 Hrs.
COURSE OUTCOMES
On completion of the course the student will be able to
CO1: Understand basic principles of cryptography and general cryptanalysis
CO2: Be acquainted with the concepts of symmetric encryption and authentication
CO3: Use the concept of public key encryption, digital signatures, and key establishment.
CO4: Be able to compose, build and analyse simple cryptographic solutions.
CO5: Implement cryptographic schemes
CO6: Be able to use Message Authentication Codes
TEXT /REFERENCE BOOKS
1. Hans Delfs and Helmut Knebl, Introduction to Cryptography: Principles and Applications, Springer Verlag.
2. Wenbo Mao, Modern Cryptography, Theory and Practice, Pearson Education (Low Priced Edition)
3. Shaffi Goldwasser and Mihir Bellare, Lecture Notes on Cryptography, Available at http://citeseerx.ist.psu.edu/.
4. Oded Goldreich, Foundations of Cryptography, CRC Press (Low Priced Edition Available), Part 1 and Part 23

END SEMESTER EXAMINATION QUESTION PAPER PATTERN

Max. Marks: 100 Exam Duration:3 Hrs.
PART A: 10 Questions carrying 2 marks each - No choice 20 Marks
PART B: 2 Questions from each unit of internal choice, each carrying 16 marks 80 Marks

B.E. CSE – BLOCKCHAIN TECHNOLOGY REGULAR 24 SYLLABUS