Home  •  Research  •  Résumé (PDF/DOC/TEXT)  •  Teaching  •  Photos  •  FunStuff  •  Contact  •  SPACE 2016


University of Hyderabad
Cryptography (Classical and Quantum), Spring 2014

Monday 6:00pm-8:00pm, Classroom 1, CRRao AIMSCS
Friday 2:00pm-4:00pm, Classroom 1, CRRao AIMSCS

Instructor: Vishal Saraswat, E-mail: vishal.saraswat@gmail.com
Office Hours: By appointment

Course URL: http://www.math.umn.edu/~math-sa-sara0050/teaching/13s/



Feedback Form (Anonymous)







Back to Class Page

Announcements



28-Mar:
Midterm info available
12-Mar:
Third Midterm Exam will be on 28-Mar-2014 from 2:15pm-3:15pm.
12-Mar:
The schedule for student presentations is:
Wednesday
2-April-14
6:30pm-7:30pm
EPR non-separability Aswathi
Vinod
Navita
Friday
4-April-14
2:00pm-3:00pm
Quantum Dense Coding Bhavana
Pratyusha
Swami
Sampath
Friday
4-April-14
3:00pm-4:00pm
QKD Jagdeesha
Akhil
Shankar
Monday
7-April-14
6:00pm-7:00pm
No Cloning Nagesh
Ravi Shankar
Prabhakar
Monday
7-April-14
7:00pm-8:00pm
Error Correcting Subbu
Gourav
Narottam
Friday
11-April-14
2:00pm-3:00pm
Teleportation Anku
Abhishek
Munjal
Friday
11-April-14
3:00pm-4:00pm
Eavesdropping Suresh
Nishma
Vanaja
3-Mar:
Friday (14-March) class has been rescheduled to Wednesday (12-March) 6pm-8pm
3-Mar:
Friday (7-March) class has been rescheduled to Wednesday (5-March) 6pm-8pm
28-Feb:
Midterm info available
14-Feb:
Second Midterm Exam will be on 28-Feb-2014 from 2:15pm-3:15pm.
27-Jan:
Midterm info available
20-Jan:
The class time has been changed from Wednesday 6pm-8pm to Friday 2pm-4pm.
15-Jan:
First Midterm Exam will be on 27-Jan-2014 from 6:30pm-7:30pm.
06-Jan:
Welcome to Cryptography: Spring 2014.

Back to Class Page

Homeworks



All the programming assignments are to be done in C or C++. Submit one single text (.c or .cpp) file with the "readme" section on the top. The name of the file must be of the format "id1-id2-id3-hw1.c" or "id1-id2-id3-hw1.cpp". The file should be emailed to me by the submission deadline with heading "Cryptography Homework #".

Homework 1:
Implement Euclidean and extended Euclidean algorithm to find the inverse, if any, of an integer a modulo another integer m.
Your program should take as user inputs a and m and output a-1 mod m.
Homework 2:
Implement the Euclidean algorithm to find the GCD of two polynomials f and g with integers coefficients. Your program should take as user inputs f and g and output a polynomial h = gcd(f,g).
Extra Credit: Same as above but for polynomials with coefficients from Zm for some integer m > 1.
Homework 3:
Homework 3
Homework 4:
Homework 4
Homework 5:
Homework 5

Back to Class Page

Exams



28-Mar:
Midterm 3 solution sketch
The scores on the exam are as follows The average was 12.7 and the median was 14.0.
12-Mar:
Third Midterm Exam will be on 28-Mar-2014 from 2:15pm-3:15pm.
28-Feb:
Midterm 2 solution sketch
The scores on the exam are as follows The average was 11.73 and the median was 11.75.
14-Feb:
Second Midterm Exam will be on 28-Feb-2014 from 2:15pm-3:15pm.
27-Jan:
Midterm 1 solution sketch
The scores on the exam are as follows The average was 13.4 and the median was 16.0.
15-Jan:
First Midterm Exam will be on 27-Jan-2014 from 6:30pm-7:30pm.

Back to Class Page

Useful Links



CS6160: Cryptology
Handbook of Applied Cryptography