Back close
Admissions

Course Detail

Course Name Special Topics in Cryptography
Course Code 24CY762
Program M. Tech. in Cyber Security
Credits 3
Campus Coimbatore

Syllabus

Syllabus

Lattice based cryptography – Integer lattices, Hard problems on lattices – Shortest Vector Problem, Closest Vector Problem, Bounded Distance Decoding, Shortest Independent Vector Problem, Learning With Errors, Ring LWE, Short Integer Solution, Ring SIS, Code based cryptography, Hash based cryptography, Homomorphic encryption, BLS signatures, Group signatures, Identity based encryption, Broadcast encryption, Functional encryption, Secure Multi party computation- Visual Cryptography. 

Objectives and Outcomes

Prerequisite

24CY602 Network Security

 

Course Outcome
 

Course Outcome  

Bloom’s Taxonomy  

Level  

CO 1  

Understanding the NP hard problems on Lattices 

L1,L2  

CO 2  

Understanding hardness of code based cryptography 

L2,L5  

CO 3  

Understanding homomorphic encryption and its applications 

L4  

CO 4  

Evaluation of Identity based cryptosystems 

L2,L3,L4  

CO 5  

Understand the concepts of functional encryption 

L2,L3,L5,L6  
 
CO-PO Mapping

CO-PO Mapping  

CO/PO  

PO 1 

PO 2 

PO 3 

PO 4 

PO 5 

PO 6 

PO 7 

PO 8 

PO 9 

PO 10 

PSO1 

PSO2 

PSO3 

CO 1 

1 

2 

2 

1 

2 

1 

– 

1 

2 

– 

0 

0 

0 

CO 2 

1 

2 

2 

1 

2 

1 

– 

1 

2 

– 

1 

1 

1 

CO 3 

1 

2 

2 

1 

2 

1 

– 

1 

2 

– 

1 

1 

1 

CO 4 

1 

2 

2 

1 

2 

1 

– 

1 

2 

– 

1 

1 

1 

CO 5 

1 

2 

2 

1 

2 

1 

– 

1 

2 

– 

1 

1 

1 

Text Books / References

  1. Daniele Micciancio and Shafi Goldwasser,Complexity of Lattice Problems: A Cryptographic Perspective, 2002. 
  1. J. H . Silverman,The Arithmetic of Elliptic Curves, Vol. 106, Dordrecht: Springer, 2009. 
  1. C. Boyd and A. Mathuria,Protocols for Authentication and Key Establishment,Springer, 2010. 
  1. L. Dong and K. Chen,Cryptographic Protocol: Security Analysis Based on Trusted Freshness, Springer, 2012. 
  1. Peikert, C.,A decade of lattice cryptography,Foundations and Trends in Theoretical Computer Science, 10(4), pp.283-424, 2016. 
  1. Dan Boneh and Victor Shoup,A Graduate Course in Applied Cryptography, V4, 2017. 
  1. Rings and Integer Lattices in Computer Science, lectures notes from the Bellairs-McGill workshop on Computational Complexity in 2007. 

DISCLAIMER: The appearance of external links on this web site does not constitute endorsement by the School of Biotechnology/Amrita Vishwa Vidyapeetham or the information, products or services contained therein. For other than authorized activities, the Amrita Vishwa Vidyapeetham does not exercise any editorial control over the information you may find at these locations. These links are provided consistent with the stated purpose of this web site.

Admissions Apply Now